Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matan Vetzler

dblp:318/1116 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Question answering and dialogue systems · 60% Language models and text generation · 40%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › large language model security
Adversarial attack on LLM agents
0.912025
Effective Red-Teaming of Policy-Adherent Agents · EMNLP 2025
Natural language and speech › Question answering and dialogue systems › intent detection
few-shot intent detection
0.712023
QAID: Question Answering Inspired Few-shot Intent Detection · ICLR 2023
Natural language and speech › Question answering and dialogue systems
intent detection
0.712023
QAID: Question Answering Inspired Few-shot Intent Detection · ICLR 2023
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.312025
Effective Red-Teaming of Policy-Adherent Agents · EMNLP 2025

Methods — techniques the papers use, named apart from their topics

persuasive strategies · 1.7multi-agent red-teaming · 1.7DAN prompts · 1.7few-shot learning · 0.7
YearPublicationVenuePosition
2025 Effective Red-Teaming of Policy-Adherent Agents
abstract
Task-oriented LLM-based agents are increasingly used in domains with strict policies, such as refund eligibility or cancellation rules.The challenge lies in ensuring that the agent consistently adheres to these rules and policies, appropriately refusing any request that would violate them, while still maintaining a helpful and natural interaction.This calls for the development of tailored design and evaluation methodologies to ensure agent resilience against malicious user behavior.We propose a novel threat model that focuses on adversarial users aiming to exploit policy-adherent agents for personal benefit.To address this, we present CRAFT, a multi-agent red-teaming system that leverages policy-aware persuasive strategies to undermine a policy-adherent agent in a customerservice scenario, outperforming conventional jailbreak methods such as DAN prompts, emotional manipulation, and coercive.Building upon the existing τ -bench benchmark, we introduce τ -break, a complementary benchmark designed to rigorously assess the agent's robustness against manipulative user behavior.Finally, we evaluate several straightforward yet effective defense strategies.While these measures provide some protection, they fall short, highlighting the need for stronger, researchdriven safeguards to protect policy-adherent agents from adversarial attacks. 1 .
Itay Nakash, George Kour, Koren Lazar, Matan Vetzler, Guy Uziel, Ateret Anaby-Tavor
EMNLP4
2023 QAID: Question Answering Inspired Few-shot Intent Detection
Asaf Yehudai, Matan Vetzler, Yosi Mass, Koren Lazar, Doron Cohen 0001, Boaz Carmeli
ICLR2