- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes HiDe, which trains long-horizon agents to delete history that has become substitutable by later environment feedback. At each step the agent chooses DELETE or WAIT. After deletion, the same realized next response is scored under the reduced context and under a context restoring only the newly deleted blocks; the log-probability gap estimates residual dependence on the deleted content. This dependence is combined with cumulative input savings into a hindsight utility, which supplies both decision-level credit and trajectory-level task rewards. Across the evaluated environments, HiDe generally achieves strong task-performance and input-efficiency improvements over the included baselines, although the gains are environment-dependent and the evidence is less conclusive for long-horizon deletion safety.
Critical strengths
- The paper introduces a coherent hindsight-training framework for learning selective history deletion from the agent’s own future behavior.
- The empirical study evaluates both task quality and input efficiency across several environments, providing evidence that the method can improve the score–cost trade-off in many settings.
Critical weaknesses
- The central supervision signal is not aligned with the claimed long-horizon deletion objective. HiDe measures the likelihood gap of one already-realized next response under deleted and restored contexts, but does not estimate whether deleting the block preserves future task success or the value of alternative future actions. A low gap can mean that the model ignores the block in this particular continuation, not that the block is safely removable. Restoring a block while holding the new observation and realized response fixed also does not establish that the environment supplied an equivalent replacement or that the information will remain unnecessary under future branches.
Questions for authors
- Could you evaluate an alternative signed utility in which deletions with sufficiently high dependence receive negative credit and are explicitly worse than WAIT? For example, a signed or directional likelihood gap, or an explicit harmful-deletion penalty, would test whether the current nonnegative utility induces excessive deletion.
- Can you quantify the training-time overhead of hindsight scoring, including the number of extra forward passes per eligible deletion, whether reduced-view rollout log-probabilities are reused, wall-clock time, GPU hours, peak memory, and throughput? A break-even analysis would clarify how many deployment episodes are needed for the reported input-token savings to amortize this additional training computation.