arXiv Computation and Language
EvoBrowseComp: Benchmarking Search Agents on Evolving Knowledge
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
Related stories
arXiv Machine Learning
Aug 12
SearchArt: Training Long-Horizon Search Agent with Scalable Synthetic and Verified Task
arXiv:2607. 24850v2 Announce Type: replace-cross Abstract: Recent advances in large language models (LLMs) have enabled search agents to autonomously tackle complex tasks across extended search and reasoning horizons.
arXiv AI
Jun 6
A2RAG: Adaptive Agentic Graph Retrieval for Cost-Aware and Reliable Reasoning
arXiv:2601. 21162v2 Announce Type: replace-cross Abstract: Graph Retrieval-Augmented Generation (Graph-RAG) enhances multihop question answering by organizing corpora into knowledge graphs and routing evidence through relational structure.
arXiv AI
Jun 10
LakeQA: An Exploratory QA Benchmark over a Million-Scale Data Lake
arXiv:2606. 10460v1 Announce Type: cross Abstract: Recent large language models (LLMs) have shown rapid progress in reading-based question answering (QA), where evidence is explicitly provided or can be trivially retrieved.
arXiv AI
Jun 17
Branch-and-Browse: Efficient and Controllable Web Exploration with Tree-Structured Reasoning and Action Memory
arXiv:2510. 19838v2 Announce Type: replace Abstract: Autonomous web agents powered by large language models (LLMs) show strong potential for performing goal-oriented tasks such as information retrieval, report generation, and online transactions.
arXiv AI
Jun 6
AdaMEM: Test-Time Adaptive Memory for Language Agents
arXiv:2606. 05684v1 Announce Type: new Abstract: A central challenge for language agents is utilizing past experience to adapt to dynamic test-time conditions.
arXiv AI
Sep 10
AMA: Adaptive Memory via Multi-Agent Collaboration
The paper introduces AMA, a framework that uses multiple agents—Constructor, Retriever, Judge, and Refresher—to manage memory for large language model agents. AMA’s hierarchical memory design dynamically adjusts retrieval granularity to match task complexity, while the Judge and Refresher ensure relevance, consistency, and timely updates. Experiments on long-context benchmarks show AMA outperforms existing baselines and cuts token usage by about 80% compared to full-context approaches.