让大模型长程任务更准更快:异步压缩+验证机制
Slipstream: Trajectory-Grounded Compaction Validation for Long-Horizon Agents

- 异步并行压缩,先生成摘要再验证是否匹配后续推理
- 在编码和浏览任务中准确率最高提升8.8个百分点
- 适合需要长时间推理的智能体系统开发者
为应对长时序大模型智能体产生的大量上下文,现代框架依赖压缩——用大模型将累积轨迹重写为更短摘要以继续执行。当前压缩同步运行于智能体执行关键路径上,但因结构验证缺口导致准确性不可预测:压缩器需精简上下文,却无法知晓智能体未来所需信息。且压缩后步骤依赖新摘要,缺乏针对性验证标准,错误会无声传播至连贯但错误的行为中。我们的核心洞察是:异步压缩可有效填补此缺口——让压缩器与智能体在原始上下文上并行执行,候选摘要与智能体下一步推理独立生成,均源自同一预压缩状态,从而获得不依赖摘要本身的验证信号。我们构建了Slipstream,一种基于轨迹的压缩验证系统,使用判别器验证候选摘要是否保留了智能体的前进意图以及其依赖的关键事实与约束。在长时序编码(SWE-bench Verified)和网页浏览(BrowseComp)任务中,Slipstream将任务准确率提升最高达8.8个百分点,同时端到端延迟降低最多39.7%。
原文摘要 · Abstract (English)
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%.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。