Robustness of Search Agents under Adversarial Conditions
Determine the performance characteristics of large language model–based agentic search agents when operating in adversarial retrieval environments, and establish robustness guarantees and practical methodologies to ensure these agents remain reliable in real-world deployments.
References
While Search Wisely explores uncertainty-aware search to mitigate overconfidence, it remains unclear how search agents perform under adversarial conditions and how to guarantee robustness in real-world deployments.
This vulnerability is shared by any method that reads that log. Accidental noise is not a problem (injecting up to $16$ irrelevant documents per rollout leaves the vote unchanged), but adversarial robustness remains open.
We leave a controlled evaluation of these defenses to future work; the present paper focuses on characterizing the attack.