DRSR: Learning Set-Level Deletion Risk for Efficient Long-Horizon Agents

๐Ÿ“… 2026-09-22
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
ๆœฌๆ–‡ๆๅ‡บDRSRๆ–นๆณ•๏ผŒ้€š่ฟ‡่ฏ„ไผฐๅˆ ้™คๅކๅฒ่ฎฐๅฝ•้›†็š„้ฃŽ้™ฉๆฅๅŽ‹็ผฉไปฃ็†ๅކๅฒ๏ผŒๆ้ซ˜้•ฟๅ‘จๆœŸไปฃ็†ๆ•ˆ็އ๏ผŒๅŒๆ—ถไฟๆŒๆ€ง่ƒฝใ€‚
๐Ÿ“ Abstract
Long-horizon language-model agents accumulate reasoning traces, tool exchanges, and observations whose relevance changes with the current decision. Existing compression strategies often score historical units independently, but the safety of deleting several units is generally not determined by their singleton scores: redundant evidence, accumulated small effects, and the information that remains after deletion all matter. We introduce Direct Relational Set-Risk Pruning (DRSR), which formulates agent-history compression as risk-constrained selection over deletion sets. Offline, DRSR constructs exact counterfactual supervision by jointly deleting protocol-valid history Blocks and measuring the change in teacher-forced likelihood of the same recorded next output. A lightweight scorer then predicts set-level harm from online-visible relations between candidate history and the current pre-action state, together with deleted-retained and pairwise set structure. At deployment, DRSR evaluates a small set of structurally valid deletion candidates with the lightweight scorer and removes the largest feasible set under recency, protocol, budget, and learned-risk constraints, abstaining when no set is sufficiently safe. On WorkBuddyBench Full260, DRSR increases mean reward from 0.699 to 0.802 while reducing total model tokens by 20.820%. On the fixed Eval40 comparison, it obtains 0.794 reward at 1.211M tokens per task, using 35.850% fewer tokens than the uncompressed agent. Mechanistic analyses and ablations further show that decision-conditioned relations, retained-context information, pair interactions, and abstention each contribute to reliable pruning.
Problem

Research questions and friction points this paper is trying to address.

long-horizon agents
history compression
deletion risk
redundant evidence
accumulated effects
Innovation

Methods, ideas, or system contributions that make the work stand out.

Direct Relational Set-Risk Pruning
counterfactual supervision
set-level risk prediction
lightweight scorer
decision-conditioned relations
๐Ÿ”Ž Similar Papers
No similar papers found.
M
Mingxuan Wang
TierFlow Team
B
Bo Wang
TierFlow Team
F
Fei Luo
TierFlow Team
G
Guorun Yao
TierFlow Team
C
Chao Ning
TierFlow Team
Y
Yinglong Guo
TierFlow Team
H
Hongyue Chen
TierFlow Team
Y
Yanbiao Ma
Gaoling School of Artificial Intelligence, Renmin University of China
Jungong Han
Jungong Han
Chair Professor in Computer Vision, University of Sheffield, UK, FIAPR, FAAIA
Computer VisionVideo AnalyticsMachine Learning