- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes a framework for evaluating long-horizon risks in repeated memory-compaction systems using short reset tests. Its novelty compared with the state of the art is a criterion that determines whether retained output statistics are sufficient to identify future risk. To achieve this, the framework models memory errors as a finite-state Markov process. Evaluation on synthetic processes shows that accurate short-horizon tests may fail to identify long-horizon risk, while richer statistics sometimes improve risk analysis but require very large testing budgets.
Critical strengths
- Problem of determining long-horizon risks is interesting and relevant
Critical weaknesses
- The paper is poorly written and very difficult to follow.
- The research problem, practical objective, and intended use case are not defined clearly enough.
- The evaluation is difficult to understand, including what is being measured and which baseline is the main comparison.
- The experiments use only synthetic processes and do not evaluate a real memory-compaction system.
- The technical novelty is limited because the method mainly combines established random-set and robust dynamic-programming techniques.
- The required testing budgets reach millions of calls, which makes the approach impractical for the motivating LLM use case.
Questions for authors
No question whose answer could affect my assessment.
Response to Reviewer h8C1
Thank you for the review.
W1: the paper is hard to follow. We agree, and we rewrote the abstract and introduction in plain language (pages 1–2). Section 3 now defines the core terms before the analysis uses them, with a two-record example (pages 2–3). Sections 3–6 open by saying what they show, and the captions of Figures 1–2 and Tables 1–2 explain every axis and column.
W2: problem, objective and use case. The introduction now states all three (pages 1–2), and a box in Section 3 restates them (page 3). A one-step reset test sets the memory to a chosen, possibly corrupted, state, runs one update, and keeps a statistic of the output. The problem is to decide when that statistic determines R_H, the probability that a query fails after H updates. The objective is a certificate: an upper bound on R_H that holds with probability at least 1 − δ (δ = .05) for all horizons at once. The paper has two intended uses. It warns anyone who summarizes one-step tests that per-record error rates, error counts, clean-input results and two-step checks can leave long-horizon risk undetermined, even with unlimited samples. It also gives certificates for cheap resettable software whose small error state is fixed in advance from how it works, but it is not a practical test for large language model (LLM) memory.
W3: what is measured, and the main baseline. The Protocol paragraph of Section 7 now answers both under separate labels (page 8). Each synthetic experiment reports the mean upper bound on R_H over independent datasets and compares it with the exact risk, while the LLM pilot compares the bounds from one reset dataset with a rollout estimate. The main baseline is direct testing, which spends the same number of calls on runs of H updates and bounds their mean final loss. It fills the last column of Tables 1 and 2 and all of Appendix M. Direct testing gives tighter bounds for every 8- and 12-record design in Table 2. At 12 records, 2,097,152 calls and H = 128, for example, its bound is 4.69 × 10⁻³, against 4.95 × 10⁻² for our certificate built from error counts. At H = 128, direct testing is looser in every 4-record design, in the two rows of Table 1 where the evaluator is told the mechanism's structure, and in our added experiment on a third-party cache library (Section 7.3).
W4: synthetic processes only. We agree that this was the main gap. The revision adds a pilot with a real LLM, run under a protocol written before the main runs (Section 7.4, Appendix O), and our general response summarizes it.
W5: limited novelty. We agree that the bound computation uses established random-set and robust dynamic-programming tools, and that one direction of Theorem 2 follows from value-equivalence reasoning in reinforcement learning, as Sections 1 and 2 say. Our new results concern what test summaries can determine: an exact risk range that per-record error rates can leave open (Theorem 1), the converse of Theorem 2's identification criterion when some transitions are known to be impossible, and the counterexample of Section 4.3. In that counterexample, two processes share every error-count statistic and their two-step risk, yet reach risks of 0.52 and 1 − 1.87 × 10⁻³ (nearly 1) at step 128.
W6: budgets of millions of calls. Such budgets are impractical for LLM updates, and at these budgets direct testing also gives tighter bounds than our certificates (Appendix M). The results on what a test can determine (Theorems 1–2 and Section 4.3) involve no sampling, so they hold whatever the budget. In the LLM pilot, the reset test used 2,048 calls, and direct testing with the same calls was again tighter (0.56 against 0.73 at H = 32).