- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The method predicts the downstream effect of removing interactions from a rolling history, then combines deletion ordering, adaptive history size, and redundancy compression. SUMO and ScienceWorld experiments report lower policy-token consumption with broadly comparable task performance.
Critical strengths
-
Task-dependent removal supervision provides a useful alternative to recency and similarity. Total tokens decrease by 23.2–25.8% in driving and 52.1% in ScienceWorld relative to Full-H20, with paired-bootstrap analyses supporting the reported savings.
-
Compression-controlled recency, matched fixed-budget variants, and LongLLMLingua provide meaningful controls. These show that selection contributes beyond compression alone, particularly under distribution shift, although the controlled gains are smaller than the headline savings.
Critical weaknesses
-
Evidence is limited to a 20-item rolling window and relatively short runs. A structured summary plus recent-history baseline is absent, so the results do not establish an advantage over broader long-horizon memory management.
-
Total tokens are not end-to-end serving cost. Cache reuse, input/output pricing, and predictor-development cost are not jointly evaluated; reported latency excludes policy inference. ScienceWorld headline returns are running-max statistics: selection-active mean return is 74.22 versus 74.34 for Full-H20. Nonsignificant differences do not establish equivalence.
Overall assessment: Weak acceptance, borderline leaning accept. The controlled results support a useful bounded-history contribution; broader deployment efficiency remains unproven.
Questions for authors
-
Clarification: Can the efficiency claim be restricted to the evaluated bounded-history setting, with running-max and mean returns clearly distinguished?
-
Evidence: Is a structure-preserving summary-plus-recent-history comparison available? Under a specified serving configuration, how do cache-aware cost and end-to-end latency compare after including context-management overhead?
We thank the reviewer for the feedback. We provide additional clarification on the evaluation scope and return metrics, along with new comparisons against a structure-preserving Summary + Recent baseline and measurements of cache-aware serving cost and latency.
Q1. Evaluation Scope and ScienceWorld Returns
Our efficiency claims are restricted to the evaluated bounded-history setting, where both Driving and ScienceWorld use a rolling window of W = 20 interactions. All available histories are retained before the window reaches full capacity, and adaptive selection is applied once the window is full. We have clarified this scope in the revised manuscript.
We have also distinguished the ScienceWorld return metrics. Table 2 reports best-of-40 return (running-max), defined as the highest observed return across 40 formal rounds for each task, averaged across tasks. Ours achieves 96.06 compared with 95.50 for Full-H20.
Appendix E additionally reports mean return. The mean returns are 74.22 for Ours and 74.34 for Full-H20. These statistics describe different aspects of observed task performance.
Q2. Structure-Preserving Summary + Recent Baseline
We additionally evaluated a structure-preserving Summary-16 + Recent-4 baseline under the same ScienceWorld closed-loop protocol, covering 18 tasks and 40 formal rounds per task.
Once the H20 window is full, the baseline summarizes the older 16 interactions individually and retains the four most recent interactions in their original form. It preserves the action history, step-level rewards, and temporal ordering, and generates summaries only from completed interactions.
The comparison is summarized below:
Compared with Summary + Recent, Ours reduces all-round policy token usage by 11.1% and late-round policy token usage by 27.7%. The mean returns are closely matched, while Summary + Recent achieves a slightly higher observed best-of-40 return.
Under the same fixed-trace replay protocol, Ours also achieves 48.0% lower mean end-to-end latency (11.03 s vs. 21.20 s). These results demonstrate lower token consumption and serving latency compared with this structure-preserving summarization baseline, while maintaining similar observed mean returns.
Q3. Cache-Aware Inference Cost and End-to-End Latency
We conducted fixed-trace inference replays using actual downstream-policy API calls, with GPT-4o for Driving and GPT-4.1 minifor ScienceWorld under a fixed serving configuration. End-to-end serving latency was measured from context preparation through downstream-policy inference, response parsing, and logging. It includes embedding, predictor inference, history selection, redundancy compression, or summarization where applicable.
API costs were calculated using recorded input, cached-input, and output token usage under the applicable model pricing, including embedding API charges.
For Driving, the measured API costs per decision decrease from $0.02026 to $0.01299 on Held-out ID, $0.02390 to $0.01474 on Severe-3x, and $0.01868 to $0.01322 on Unseen Routes. These correspond to reductions of 35.9%, 38.3%, and 29.2%, respectively. The end-to-end latency measurements reveal a trade-off: Ours increases serving latency by 15.8–20.7% relative to Full-H20 in Driving.
For ScienceWorld, the measured fixed-replay API cost decreases from $0.04863 to $0.01625 per trial, representing a 66.6% reduction relative to Full-H20. The corresponding end-to-end latency measurements are:
Under this replay protocol, Ours achieves 6.3% lower latency than Full-H20. The evaluation includes 108 Driving measurements and 36 complete ScienceWorld trial replays across Full-H20, Recent-K, and Ours, with an additional matched-trace comparison for Summary + Recent.
The revised manuscript clarifies the bounded-history scope and ScienceWorld return metrics in the main text and Appendix E. Appendix K provides the fixed-trace serving-cost and latency methodology. The additional Summary + Recent comparison is reported in Appendix M.