arXiv Computation and Language

Cognitive Bias Signatures in Search-Equipped LLM Agents: A Stage-Resolved Analysis

arXiv AI
Oct 15

Search-G1: Co-Evolving Representation-Based Rewards for Selective Grounded Search

Search-G1 is a reward framework that encourages language agents to retrieve external information only when necessary and to ground their answers in that evidence. It uses two hidden‑state readouts—one predicting whether a closed‑book answer suffices and another measuring sensitivity to evidence deletion—to calibrate retrieval necessity and evidence reliance. The reward system gates evidence credit by necessity, rewards sufficient direct answers, and penalizes redundant searches, all without requiring costly annotations or LLM‑judge inference.

By Ruoxi Cheng, Haoxuan Ma, Hongyi Zhang, Junming Zhang, Ranjie Duan, Qiaolin Xia, Hao Wang, Yu Lu, Haibo Shi, Xingjun Ma
arXiv AI
Oct 16

Beyond Downstream QA: Rethinking How We Evaluate Agent Memory

The paper critiques current agent memory benchmarks that rely on downstream QA accuracy, arguing they conflate memory correctness with retrieval and generation quality, leading to misleading results. It introduces FEB-30, a new benchmark of 30 fact‑evolution trajectories across six diagnostic categories and three difficulty levels, generated automatically to provide deterministic ground truth. Using FEB-30, the authors show a significant divergence between intrinsic and extrinsic evaluations, revealing that a representative memory system correctly classifies memory operations only 20% of the time—an error invisible to traditional QA metrics.

By Sebastian-Antonio Toma, Jean de Kernier, Mike Ply, Oliviu Matei
arXiv AI
Oct 16

Retrieved but Not Read: Understanding Why Search-Augmented LLMs Fail to Use Available Evidence

The paper investigates why large language models (LLMs) sometimes give outdated answers even when recent evidence is available through web search. By creating temporal facts that changed after the models’ training cutoffs, the authors evaluate a proprietary model with deployed search and six open-weight models with controlled retrieval. They find that models often rely on search snippets without opening source pages, leading to more outdated answers and unfaithful citations, and that even when retrieved evidence influences internal predictions, the final answer may still favor outdated information.

By Owen Walters, Lihu Chen, Francesca Toni
arXiv AI
Oct 19

From Relevant Memories to Sufficient Evidence: Rethinking Memory Utilization in LLM Agents

The paper introduces QEMem, a framework that rethinks how large language model agents use long‑term memory by constructing query‑specific evidence sets rather than relying on individual memory relevance. QEMem combines query‑guided discovery, source‑grounded reification into structured ViewCards, and sufficiency‑guided refinement to assemble comprehensive evidence from multiple memory granularities. Experiments show that QEMem achieves 91.43% LLM‑judge accuracy on LoCoMo with Claude Opus 4.5, surpassing leading baselines by significant margins and improving evidence coverage for cross‑session queries.

By Shixuan Li, Wei Yang, Peiyu Zhang, Anzhe Cheng, Heng Ping, Xiaole Zhang, Jesse Thomason, Xuezhe Ma, Yue Zhao, Paul Bogdan
arXiv Computation and Language
2d ago

RAP: Research Attention Prediction in Language Agents

The paper introduces Research Attention Prediction (RAP), a benchmark designed to evaluate large language model (LLM) agents’ ability to infer changes across entire research fields from limited evidence gathered during online scholarly searches. RAP is built on a local search environment comprising 356,357 dated arXiv papers and includes two evaluation sets: a Core set of 2,160 questions covering 54 AI/ML fields and an Extended set spanning 269 fields. Experiments show that while search improves agents’ recognition of recent changes, their forecasting of future shifts remains limited or even negative, indicating that LLM agents can detect some recent developments but struggle to reliably anticipate future research activity.

By Yingqian Wu, Jingcong Liang, Shengbin Yue, Siyuan Wang, Zhenfei Yin, Junchi Yu, Zhongyu Wei
arXiv Computation and Language
Oct 12

SEEDS: Preview-Guided Evidence Admission for Search Agents

The paper introduces SEEDS, a preview-guided evidence admission framework that allows search agents to selectively admit retrieved documents into their reasoning process. SEEDS exposes lightweight previews of candidates and lets the agent decide which and how many to fully inspect based on its current reasoning state, enabling arbitrary subset selection rather than fixed or rank-based policies. Experiments on nine knowledge-intensive QA benchmarks show that SEEDS improves search effectiveness and reduces full-evidence consumption compared to traditional retrieval prefixes.

By Jiajin Liu, Chenxi Xu, Dongzhe Fan, Yuanfu Sun, Qiaoyu Tan
arXiv AI
Oct 15

JevGPT: Thinking Fast and Slow in Autonomous Research

JevGPT is a dual‑system architecture for autonomous research that combines fast evidence processing (System One) with deliberative research planning (System Two). System One quickly locates and evaluates relevant passages, while System Two sets evidence objectives and integrates findings into subsequent research steps. Experiments on question answering and document ranking demonstrate that JevGPT outperforms comparable agents, achieving faster completion, lower cost, and broader source coverage.

By Yasheng Sun, Yanning Dai, Yimeng Chen, Nanbo Li, Firas Laakom, Yifan Xu, Piotr Pi\k{e}kos, Mateusz Ostaszewski, Wenyi Wang, Cheng Luo, Yuhui Wang, J\"urgen Schmidhuber