Skip to content
Preprint

Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instability

Aug 2026 · 5 citations · ⚡ 1 influential · 66 references
Computer Science

TL;DR

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.

Abstract

Recurrent context compression controls context growth in long-horizon agents, but its behavioral effects remain poorly understood. In this preliminary empirical study, we show that compression can weaken the influence of recent interactions, increasing blocked actions, repeated exploration, and instability across runs. Motivated by these observations, we introduce TRACE, 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. Initial results on AppWorld show improvements over existing compression baselines in task performance, multi-run reliability, and context--execution efficiency. These findings provide early evidence for boundary-local evaluation as a promising direction for reliable agent context compression.

View source

Similar papers

Review

Context Compression for LLM Agents: A Survey of Methods, Failure Modes, and Evaluation

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).

Unknown authors · 10 citations
#artificial intelligence Preprint Sep 2026

Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuations

It is found that compression degrades reliability before solvability and proposed PAIR (Prompt Adaptation using Interventional Rollouts) for adapting structured compression prompts achieves the strongest cross-run reliability among compressed methods in every main benchmark-scope combination.

Guang-Hui Min, Liang Wu, Ming-Jia Shi et al. · 0 citations
#artificial intelligence Preprint Sep 2026

StateComp: Learning When to Compress History in Long Horizon Agents

This work proposes State Conditioned Compression (StateComp), a framework that determines when historical interactions can be safely compressed according to the current agent state, and demonstrates that it reduces total agent and summarization tokens while maintaining task performance, and achieves a 12.67-fold speedu...

Ming-Xuan Wang, Hong-Yue Chen, Ying-Long Guo et al. · 0 citations

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