- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
ReCompact studies history compaction for long-horizon coding agents, distinguishing an action’s value as an imitation target from the need to retain its consequences in the persistent workspace. A supervised graph module predicts contribution labels that weight action-level SFT and guide information retention. Two training views supervise compact generation from a trajectory prefix and continuation conditioned on the resulting compact. The paper evaluates the approach on SWE-bench Verified using a four-condition component study, targeted ablations, and measurements of post-reset repetition and inference cost. However, the reported full-model resolution differs between the submission-page abstract (49.8%) and the PDF (54.8%) and requires clarification.
Critical strengths
The distinction between action imitation and state retention is useful and well motivated. An unsuccessful edit can be a poor imitation target while remaining essential context because its effects persist after a history reset. Explicitly addressing this distinction provides a meaningful perspective on agent context management.
The controlled component study and targeted ablations examine both task outcomes and execution behavior. In particular, evaluating continuation training, retention guidance, context exhaustion, and repeated failed commands provides more informative evidence than resolution alone.
Critical weaknesses
The central graph-guided supervision pipeline is insufficiently specified. Section 3.1 introduces a supervised neural graph module without describing its architecture, graph construction procedure, annotation source, training objective, or predictive performance. The paper also does not sufficiently explain how prefix-only online labels are obtained when offline action weighting uses trajectory hindsight. The origins of the training trajectories and compact targets are unclear. These omissions prevent reproduction and make it difficult to assess whether graph structure, rather than generic importance labeling or target construction, accounts for the gains.
Important experimental comparisons remain difficult to interpret. Table 2 does not sufficiently document the external baselines’ checkpoints, training data, adaptation procedures, and evaluation budgets. The discrepancy between the webpage and PDF resolution rates materially changes the comparison with the strongest baselines. Furthermore, the no-continuation ablation does not explain whether suffix actions retain supervision under their original histories; otherwise, its performance drop could reflect reduced action supervision rather than the absence of compact-conditioned training. These issues limit the strength of the empirical conclusions.
Questions for authors
Which full-model resolution is correct: 49.8% in the submission-page abstract or 54.8% in the PDF? Please reconcile the associated ablation drops and baseline comparisons.
Please specify the graph module’s architecture, node and edge construction, supervision source, training procedure, and labeling performance. How are online prefix-only labels produced, and what evidence demonstrates the benefit of dependency edges over a graph-free label predictor?