Parallel Context Compaction for Long-Horizon LLM Agent Serving
Quick Answer
The paper introduces 'parallel compaction' for long-horizon LLM agents, enhancing control over summary volume and reducing inference time.
Quick Take
The paper introduces 'parallel compaction' for long-horizon LLM agents, enhancing control over summary volume and reducing inference time. Tested across models with 8B to 120B parameters on HotpotQA and LoCoMo benchmarks, it outperforms sequential methods in throughput and predictability.
Key Points
- Parallel compaction allows fine-grained control over summary volume for LLM agents.
- Reduces end-to-end wall time compared to sequential synchronous methods.
- Tested on models ranging from 8B to 120B parameters.
- Demonstrated improved throughput on HotpotQA and LoCoMo benchmarks.
- Enables targeted prompt engineering for better agent performance.
Paper Resources
Article Content
From source RSS / original summaryarXiv:2605. 23296v1 Announce Type: new Abstract: 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 inherently lossy and the blocking call stalls agent inference for tens of seconds.
Moreover, the operator has no fine-grained control over summary volume since prompt instructions are largely ignored, and as context grows, both the amount of output tokens the model produces and the information it retains fluctuate substantially from run to run, making the agent's retained knowledge unpredictable across runs.
We introduce \textbf{parallel compaction} for long-horizon agentic flows and characterize it against the sequential synchronous baseline across four backbones spanning 8B to 120B parameters, mixing dense and MoE architectures with reasoning and non-reasoning models, on the HotpotQA multi-hop QA and LoCoMo long-context dialogue benchmarks. Parallel compaction gives the operator fine-grained, predictable control over summary volume and enables more targeted prompt engineering per block.
At matched compaction decode volume, it reduces end-to-end wall time and improves compaction throughput over the sequential baseline.
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →Information Limits and Attractor Dynamics in Economies of Frontier LLM Agents: A Pre-Registered Test
A pre-registered experiment on Claude Opus 4.8 investigates wealth growth and population misalignment in economies, revealing that relative growth aligns with claimed information but fails to demonstrate expected noise-maintained dispersion. The experiment cost $138.76 and is fully reproducible from cached outputs.