paper-with-me

홈 › Papers

Slipstream: Trajectory-Grounded Compaction Validation for Long-Horizon Agents

2026-05-09 · Zhuofu Chen, Rui Pan, Yinwei Dai, Ravi Netravali arxiv

To cope with the large contexts that long-horizon LLM agents produce, modern frameworks increasingly rely on compaction -- invoking an LLM to rewrite the accumulated trajectory into a shorter summary that the agent resumes from. Today, compaction runs synchronously on the critical path of agent execution but this can unpredictably degrade accuracy due to a structural validation gap: the compactor must condense context but is fundamentally unaware of precisely what information the agent will need later. Further, because post-compaction agent steps are conditioned on the new summary, targeted validation criteria do not exist and errors silently propagate through coherent but incorrect behavior. Our key insight is that asynchronous compaction efficiently addresses this gap: by running the compactor in parallel with continued agent execution on the original context, the candidate summary and the agent's next steps are generated independently from the same pre-compaction state, yielding a validation signal independent of the summary itself. We build Slipstream, a trajectory-grounded compaction system that uses a judge to validate the candidate summary against the agent's continued reasoning, checking that it preserves both the agent's forward intent and the key facts and constraints it depends on. Across long-horizon coding (SWE-bench Verified) and web-browsing (BrowseComp) workloads, Slipstream improves task accuracy by up to 8.8 percentage points while reducing end-to-end latency by up to 39.7%.

📄 PDF Abstract BibTeX arXiv:2605.08580

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

CompactionRL: Reinforcement Learning with Context Compaction for Long-Horizon Agents

2026-07-06 · Yujiang Li, Zhenyu Hou, Yi Jing, Jie Tang 외 arxiv

Long-horizon agentic LLMs are increasingly limited by finite context windows, as extended interaction trajectories can exceed the maximum context length before a task is completed. Context compaction offers a natural sol…

Reinforcement Learning

Still: Amortized KV Cache Compaction in a Single Forward Pass

2026-06-05 · Charles O'Neill, Alex Sandomirsky, Harry Partridge, Mudith Jayasekara 외 arxiv

The KV cache is the memory bottleneck of long-horizon language model deployment. Practically, a deployable compactor must be lightweight enough to call during inference, expressive enough to preserve context under constr…

Self-Compacting Language Model Agents

2026-06-22 · Tianjian Li, Jingyu Zhang, William Jurayj, Xi Wang 외 arxiv

Long agent traces composed of chains of thought and tool calls accumulate stale content that anchor subsequent generations, and eventually outgrow the context window. Existing scaffolds mitigate it with fixed-interval co…

Accelerating Recommender Model Training by Dynamically Skipping Stale Embeddings

2024-03-22 · Yassaman Ebrahimzadeh Maboud, Muhammad Adnan, Divya Mahajan, Prashant J. Nair

Training recommendation models pose significant challenges regarding resource utilization and performance. Prior research has proposed an approach that categorizes embeddings into popular and non-popular classes to reduc…

CPUGPU

Parallel Context Compaction for Long-Horizon LLM Agent Serving

2026-05-22 · Musa Cim, Burak Topcu, Chita Das, Mahmut Taylan Kandemir arxiv

Long-horizon LLM agents accumulate growing conversation histories that eventually exceed the model's context window. Context compaction via LLM-based summarization keeps the conversation bounded, but summarization is inh…

Prompt Engineering