Skip to content

Not Worth Another Token: Marginal Value Estimation for Efficient Deep Research Agents

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

The results show that pruning effectiveness depends more on where pruning is applied than on the specific scoring rule: early pruning yields the largest end-to-end savings, while later pruning mainly refines the final synthesis context.

Abstract

Long-horizon research agents solve open-ended tasks through iterative retrieval, aggregation, and synthesis, but context grows rapidly while the marginal value of additional evidence often declines. This leads to unnecessary token cost, higher latency, and noisier inputs for final report generation. We study marginal value estimation for context management in deep research agents and present the first systematic stage-aware comparison of pruning strategies across the pipeline. We evaluate lightweight heuristic criteria and a learned value model at pre-retrieval, post-retrieval, and pre-synthesis stages. Our results show that pruning effectiveness depends more on where pruning is applied than on the specific scoring rule: early pruning yields the largest end-to-end savings, while later pruning mainly refines the final synthesis context. Lightweight heuristics reduce token usage by up to 73% with little quality degradation, learned pruning remains competitive on selected trade-offs, and no single method dominates across quality, efficiency, and faithfulness. These findings provide practical guidance for designing efficient long-horizon agentic systems.

View source

Similar papers

Preprint Aug 2026

When Deep Research Agents Stagnate: Enhancing Reasoning with Retrieval-Aware Agent Control

A set of unsupervised signals and a Retrieval-Aware Agent Controller (RAAC) are introduced, which assists the agent in selecting optimal actions at each stage of the research process, resulting in more effective reasoning trajectories that improve overall performance while reducing unnecessary iterations, and consequen...

Heydar Soudani, Elisabeth Lingg, Faegheh Hasibi et al. · 2 citations
Preprint Aug 2026

Read Less, Solve More: Token-Efficient Sparse Reading for AI Agents

Long-horizon agents increasingly rely on repeated access to external artifacts, yet current reading interfaces often expose entire objects even when only sparse evidence is needed. This over-reading increases token and latency costs and can dilute task-relevant evidence, while existing context-reduction methods mainly...

Ze-Dong Liu, Jiaan Wu, Xin-Yang Ma et al. · 0 citations
Preprint Sep 2026

When2Think: Learning When and How Much to Reason

This work proposes When2Think, an RLVR-based post-training framework for instance-adaptive computation allocation that requires neither a learned reward model nor a learned critic, and offline reference caching avoids online reference-model queries during policy updates.

Jaejun Shim, Hyunjin Kim, Young Jin Kim et al. · 0 citations
Preprint Sep 2026

Doing More with Less Tokens: Hierarchical Reinforcement Learning for Efficient Coding Agents

Recently, coding agents have emerged as a dominant paradigm for real-world software engineering (SWE) scenarios, which solve complex tasks through multi-turn interactions with development environments. However, frequent interactions with environments would inevitably introduce substantial token overhead, leading to hig...

Hao-Bin Li, Liang Jiang, Zhen-Yu Huang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Self Improvement via Fast Tree-search

A simple, sample-efficient self-improvement framework that significantly improves coding performance under strict budget constraints and outperforms existing tree-search based self-evolution frameworks on the full Polyglot benchmark with significantly lower resource requirements in terms of CPU hours, wall clock time,...

Xing Fu, Aravinth Kulanthaivelu, Yutaro Yamada · 3 citations · ⚡3

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.