A controlled runtime measurement protocol for reacquisition cost in a bounded-horizon tool-using agent and three models across two task regimes are evaluated, showing that the reacquisition signature is environment-dependent rather than intrinsic to shortening context.
Abstract
Task completion is the standard metric for evaluating context compression, yet it is incomplete: compression can increase an agent's interaction cost by forcing it to reacquire dropped state while leaving completion statistically unchanged. We introduce a controlled runtime measurement protocol for reacquisition cost in a bounded-horizon tool-using agent. The agent acts in a deterministic planning environment under a fixed 24-turn horizon. We vary compression severity, compare a dropping operator with a fact-preserving operator, restore dropped state through controlled oracle interventions, and decompose tool calls into retrieval and execution. We evaluate three models across two task regimes. Retrieval calls increase in all six model-regime comparisons and account for almost all added interaction; five of six remain significant after Holm correction. At the prespecified 5x comparison point, completion changes are not significant in any cell. DeepSeek shows a significant completion drop only at 10x compression. GPT-5.5 is the clearest case: completion changes from 80% to 85% (p = 1.0) while retrieval increases from 21.0 to 63.9 calls (p = .002). Retention interventions further separate state quantity, state type, and content validity. Random selection is comparable to an offline hindsight oracle, while replacing retained D-state with semantically irrelevant content increases retrieval by 57% (p<.001) without a significant completion change. In a second environment, ALFWorld, sliding compression produces no retrieval surge, showing that the reacquisition signature is environment-dependent rather than intrinsic to shortening context. Overall, compression can impose hidden interaction costs when execution-relevant state becomes absent and must be reacquired, while completion alone may not expose those costs.
CompressAgent is introduced, an environment-verified benchmark for ACC compression across nine independently constructed ACCs, three task families, three fixed Qwen API model identifiers, six retained-context budgets, and 15,525 runs, uncovering a nonlinear, method-dependent reliability frontier.
Effective optimization should be evaluated at the level of cost per successful task, including cache behavior, trajectory changes, and correctness rather than token counts alone, because token reduction is not a reliable proxy for cost reduction in tool-heavy coding agents.
Sarel Weinberger, Amir Hozez· arXiv.org· 2 citations
A unified taxonomy of agent context compression along three dimensions is introduced: compression target (what is compressed), compression mechanism (how it is transformed and retained), and control policy (who decides when compression is triggered).
This work proposes Agentic Context Management (ACM), a framework that equips agents with purpose-built context editing tools for lossless context management and develops a post-training pipeline that constructs high-quality demonstrations of context management and improves model performance on both agentic search and c...
Xiao-Chuan Li, Ryan Ming, Meng Chu et al.· arXiv.org· 1 citation
This work introduces the Roundtable Context Window Test (RCWT), a controlled protocol for measuring this task-budget displacement effect of multi-agent and memory-augmented LLM systems, and adds an intact-task ablation to test whether the fixed-budget cliff persists when task evidence remains intact.
Brenda Lelis, Rodrigo M. Cabral-Carvalho· arXiv.org· 0 citations
TRACE is introduced, a verifier-guided framework that evaluates individual compaction events through paired closed-loop continuations from the same environment state and uses summary preferences to optimize a natural-language compression prompt while keeping all models frozen.