The paper introduces VHOP, a data generation framework and benchmark for visual agentic search, and VHOP-Router, an end‑to‑end training pipeline that turns a standard embedding model into an autoregressive multi‑step retriever operating directly in visual latent space. VHOP-Router eliminates the need for intermediate text queries, boosting retrieval accuracy from under 5% to 76.3% and improving task success rates by 52.7% while dramatically reducing token usage and API payloads. The approach generalizes to unseen difficulty levels and realistic test sets, offering an efficient solution that preserves native LLM capabilities.
By Tianyu Chen, Mingyuan Zhou, Jiaxing Wu
arXiv:2603.18272v2 Announce Type: replace
Abstract: While large language models (LLMs) have advanced the development of general-purpose agents, robust generalization to unseen tasks remains challengi...
By Thomas Palmeira Ferraz, Romain Deffayet, Vassilina Nikoulina, Herv\'e D\'ejean, St\'ephane Clinchant
TRACE is a lightweight learned selector that ranks completed search trajectories by aggregating cross‑rollout evidence, preserving individual query and evidence occurrences while propagating information across shared content or document identity. Trained with answer‑level supervision over frozen text embeddings, TRACE selects an existing answer without additional search or autoregressive aggregation, and a single selector generalizes across rollout policies and agent backbones. Across six WebQA policies, six long‑horizon dataset‑backbone combinations, and multiple WebQA benchmarks, TRACE outperforms majority voting and generative aggregators, achieving higher accuracy and at least tenfold higher processing throughput.
By Qisheng Zhou, Zhen Xiong, Qiaoyu Tan
arXiv:2608. 12847v1 Announce Type: new Abstract: Retrieval can identify a past trajectory that may matter, yet it does not specify how an acting agent should use that trajectory after users, entities, constraints, or environment state have changed.
By Yifei Li, Heng Wang, Lingling Zhang, Muye Huang, Xinyu Zhang, Jiashuai Liu, Hang Yan, Rongman Xu
arXiv:2604. 23336v3 Announce Type: replace-cross Abstract: Unlike traditional fact-based retrieval, rationale-based retrieval typically necessitates cross-encoding of query-document pairs using large language models, incurring substantial computational costs.
By Teng Chen, Sheng Xu, Feixiang Guo, Xiaoyu Wang, Qingqing Gu, Hongyan Li, Luo Ji
arXiv:2601.21545v2 Announce Type: replace
Abstract: Agentic systems accumulate persistent memory across sessions, tools, and tasks, and a later request must retrieve from it under two distinct constr...
By Yang Zhao, Chengxiao Dai, Mengying Kou, Yue Xiu, Dusit Niyato
The paper introduces DEPT, a method that trains a single decoder-only large language model to both expand queries and encode documents for retrieval. By preserving document embeddings close to their initial cached values while allowing gradients to flow through the generator, DEPT stabilizes retrieval targets and enables efficient index reuse and online hard‑negative mining. Experiments on the BEIR benchmark with Qwen3‑4B‑Instruct‑2507 and LLaMA‑3.2‑3B‑Instruct show that DEPT outperforms training‑free, independently trained, and staged unified baselines, with ablations confirming the benefits of preservation, whitening, end‑to‑end expansion training, and online negatives.
By Jingyuan Wang, Richong Zhang, Zhijie Nie, Mingxin Li, Yanzhao Zhang
OpenResearcher is a fully open, reproducible pipeline for generating long‑horizon deep research trajectories that interleave search, evidence aggregation, and multi‑step reasoning. It decouples corpus bootstrapping from trajectory synthesis and runs the search‑and‑browse loop offline using three browser primitives over a 15M‑document corpus. Using GPT‑OSS‑120B as a teacher, the pipeline produced over 97K trajectories, enabling a 30B‑A3B model to achieve 54.8% accuracy on BrowseComp‑Plus and providing insights into pipeline design through controlled analysis.
By Zhuofeng Li, Dongfu Jiang, Xueguang Ma, Haoxiang Zhang, Ping Nie, Yuyu Zhang, Kai Zou, Jianwen Xie, Yu Zhang, Wenhu Chen
arXiv:2607. 21324v1 Announce Type: cross Abstract: Retrieval-Augmented Generation (RAG) systems increasingly employ multiple LLM agents.
By Paolo Pedinotti, Enrico Santus
arXiv:2605. 11611v3 Announce Type: replace Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a promising paradigm for training agentic retrieval-augmented generation (RAG) systems from outcome-only supervision.
By Jianghan Shen, Siqi Luo, Xinyu Cheng, Jing Xiong, Yue Li, Jiyao Liu, Jiashi Lin, Yirong Chen, Junjun He
arXiv:2608. 12720v1 Announce Type: cross Abstract: While Large Language Model (LLM) agents increasingly rely on long-term memory for persistent interactions, the retrieval mechanisms governing this memory are rarely treated as evolvable components.
By Haolong Chen, Liang Zhang, Zhuo Li, Lei Xue, Guanrxu Zhu
Retrieval-Augmented Generation (RAG) systems increasingly employ multiple LLM agents. Yet, most prior work optimizes components in isolation rather than coordinating improvements across the pipeline.