CAFE: Self-Improving Search Agents Need Co-Evolving Feedback
Summary
CAFE is a framework that couples a search agent and critic via shared parameters to learn in-trajectory corrective feedback, improving search performance and reducing hallucinations across benchmarks.
View Cached Full Text
Cached at: 08/26/26, 03:17 AM
Paper page - CAFE: Self-Improving Search Agents Need Co-Evolving Feedback
Source: https://huggingface.co/papers/2608.24794 Authors:
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
Abstract
CAFE couples a search agent and critic via shared parameters to learn in-trajectory corrective feedback, improving search performance and reducing hallucinations across benchmarks.
Outcome-supervised search agentslearn when and how to retrieve evidence, but terminal rewards neither localize intermediate errors nor redirect an ongoing trajectory before those errors compound. Treatingcorrective feedbackas a learnedin-trajectory interventioncouples the two roles: the agent must decide when to request and use feedback, while the critic must infer useful corrections from outcome-confounded rollouts whose failure patterns shift as the agent improves. We introduceCAFE(Coupled Agent--Feedback Evolution), a framework in which ashared-parameter modelalternates between search-agent and critic roles.CAFEinitializesfeedback-conditioned recoveryfrom trajectories built around the base agent’s own failures, then couples online and offline optimization. Duringonline RL, acomparative feedback estimateuses a prompt-level call--skip success gap to shape request returns, whilefeedback-aware advantage shapingreweightstoken advantagesbefore and after feedback. Offline,rollout-derived preference optimizationlearns feedback from matched successful and unsuccessful trajectories. On sevenagentic search benchmarks,CAFEoutperforms the evaluatedRL-based search agentson average, retains its gains across all sixout-of-domain benchmarks, and reducesanswer-level hallucinations. One-sided ablations show that improving only the agent or only the critic eventually plateaus, whereas alternating the two updates continues to improve performance. These findings suggest that a self-improving search agent needs feedback that co-evolves with the policy it guides.
View arXiv pageView PDFAdd to collection
Get this paper in your agent:
hf papers read 2608\.24794
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2608.24794 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2608.24794 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2608.24794 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Learning to Adapt: Self-Improving Web Agent via Cognitive-Aware Exploration
Proposes SCALE, a framework for self-improving web agents using cognitive-aware exploration with three adversarial roles and a graph exploration strategy. Also introduces a large-scale dataset SCALE-20k from real websites, showing significant improvements in MLLM-based web agents.
CAS: Conformalized Agentic Search via Adaptive Retrieval and Policy Weighting
This paper introduces Conformalized Agentic Search (CAS), a framework that uses Conformal Prediction to enhance the reliability of search agents by adaptively retrieving documents and weighting policies during reinforcement learning, thereby improving accuracy and reducing redundant tool calls.
Critic-R: Improving Agentic Search using Instruction-tuned Retrievers with Natural Language Introspective Feedback
Critic-R introduces a framework using a critic model to provide introspective feedback between the reasoning agent and retriever, improving agentic search performance at both inference and training time without requiring retraining the agent.
Iterating Toward Better Search: A Two-Agent Simulation Framework for Evaluating Agentic Search Architectures in E-Commerce
This paper from eBay presents a modular two-agent simulation framework for evaluating conversational shopping assistant architectures, enabling controlled comparisons of responder designs. Key findings include that rolling-window memory outperforms intent-extraction memory by 35% in speed, and that systematic failure analysis reduced failure rates by 62%.
EvoBrowseComp: Benchmarking Search Agents on Evolving Knowledge
EvoBrowseComp is an evolving benchmark with 800 contamination-free questions for evaluating search agents, designed to prevent parametric memorization and maintain temporal freshness through a three-agent framework.