- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper frames persistent memory authorization as a keep/archive decision, presents a score-collision lower bound and a fixed-continuation Bayes regret decomposition, and proposes SQCAD, a controller combining scope qualification, lineage, competitive access, and recovery. It evaluates conversational QA on LoCoMo and LongMemEval-S and introduces LifecycleBench, comprising 225 constructed worlds with paired keep/archive continuations.
The distinction between persistent eligibility and temporary retrieval is useful, and the mathematical results appear correct under their stated assumptions. However, I do not think the submission currently establishes a sufficiently strong contribution for acceptance. The certified authorization interface is not instantiated by the evaluated controllers; the public-task improvements do not isolate authorization; and the central lifecycle result largely demonstrates that a rule explicitly representing the generator’s designed conflict can resolve that conflict. These limitations affect the paper’s main argument, rather than only its deployment scope.
Critical strengths
-
A useful evaluation object. Paired keep/archive continuations make the consequences of a memory decision explicit and allow representation-restricted regret to be distinguished from controller error.
-
Correct and clearly scoped mathematical identities. The collision lower bound, conditional Bayes decomposition, and refinement result are valid. Appendix A.2 appropriately avoids applying the coarse-summary decomposition to LLM controllers that receive richer information.
-
Transparent reporting of unfavorable evidence. The paper reports adapter limitations, unchanged physical storage, failed held-out-family transfer, null continuation ablations, and conditional statistical inference. This transparency is a significant strength.
Critical weaknesses
- The theoretical results do not establish the advertised certified controller or the necessity of the proposed representation。 Theorem 1 establishes that a representation cannot support uniformly correct decisions after conflating states requiring opposite actions. This is a valid information-loss result, but it is not an intrinsic limitation of scalar representations. For any representation (Z), the scalar (E[\Delta\mid Z]) preserves its binary Bayes decision and information floor. The theorem therefore does not establish that an explicit multi-field state is necessary, nor does it derive the particular SQCAD fields.
Theorem 2 is likewise a standard conditional Bayes decomposition, as the paper acknowledges. Its application to memory decisions is useful, but the theoretical novelty is modest unless it leads to an operational method or a substantial empirical finding.
That operational connection is missing. Section 3.1 and Figure 1 describe a certified interval on the commitment contrast, but the evaluated controllers take qualification from rules or transformed views instead. The paper does not specify an implemented public probe procedure producing appropriately centered contrast observations, or demonstrate interval coverage. The stronger closure conditions in Appendix A.3 are explicitly not estimated or used.
- The public-task results do not identify a benefit from persistent authorization LoCoMo and LongMemEval-S evaluate a one-query horizon using contexts constructed before generation. The reported improvements can therefore arise from retrieval, response proposal, smoothing, redundancy control, or packing.
The internal control does not resolve this issue. Table 5 retains the authorization/access machinery while changing the view and budget configuration. Its LoCoMo F1 is approximately 0.117–0.139, compared with 0.263–0.318 for the transformed guards. Appendix B.1 explicitly acknowledges that authorization removal with the view and budgets fixed has not been tested.
This missing comparison is central: the results show that the selected context-construction pipeline helps, but do not establish that persistent authorization is responsible.
- The baseline and cost evidence support narrower conclusions than the headline comparison suggests。 The adapters are documented honestly, but several omit capabilities directly relevant to lifecycle control. Trivium omits causal-model revision and its intervention learner; Memory Worth’s end-to-end text transport remains pending; ActMem changes thresholds and retrieval depth; and Oblivion contributes its decay core under a replaced surrounding pipeline (Appendix D).
These are permissible controlled comparisons, but they do not establish that the corresponding memory systems generally lack the distinctions SQCAD introduces. The scalar audit also uses study-defined proxies, with several sharing the same version-update witness; it is not independent evidence of failure across native systems.
The significance count should be interpreted accordingly. Of the 32 favorable LongMemEval-S comparisons, 30 are against the Memory Worth, Trivium, and Oblivion adapters. Only two favor SQCAD over ActMem, both on Terra, while ActMem wins both Qwen comparisons (Table 12).
The 97.6% footprint reduction is correctly defined as authorized decision memory. Its practical value remains insufficiently established: physical storage is unchanged, and LongMemEval-S reader context increases from ActMem’s 746.2 tokens to approximately 1,645–1,714 tokens. A capability-preserving comparator and matched resource trade-off are needed before treating these results as evidence for the proposed authorization design.
Questions for authors
Which evaluated controller implements the certified interval, what does a probe observe, and what empirical coverage or sign-error guarantee does it satisfy?
With candidates, FIR/SP, guard access, packing, and budgets held fixed, what changes when persistent authorization is disabled?
Does the lineage result survive independently constructed mechanisms or changes to the utility ratios? How much of the remaining information floor is attributable to unavailable future information?
Can the authors provide a matched retrieval-only comparator and a temporal-maintenance comparator retaining the capabilities relevant to this task?
Certified interval, utility sensitivity, and temporal baselines
We thank the reviewer for the theory reconstruction and the scalar counterexample. We agree that the original paper left the certified interval disconnected from an evaluated controller, did not isolate authorization, and lacked code-reproducible comparators.
W1 — The theoretical results do not establish necessity of the particular representation
Theorem 1 is a bound on a scalar that conflates states with opposite optimal actions; for any Z, E[Δ|Z] preserves the binary Bayes decision and the information floor; the theorem does not establish necessity of the five fields. The revision states that E[Δ|Z] is evaluator-side. The necessity claim is about the contrast partition: on an unidentified pair the best committing rule has error at least 1/2 and regret at least m₊m₋/(m₊+m₋). The theorem constrains rules that must choose under the same visible information; whether an additional probe or abstention lowers regret depends on the information it yields and its cost.
W2 — Which evaluated controller implements the certified interval, and what does a probe observe?
The evaluated controllers do not construct the interval. The evaluator generates noisy observations around a training-cell mean and tests the interval against held-out branch contrasts. At the nominal 95% level, the lineage interval covers 86.8% in family and 60.7% under family holdout. Table 7: in-family 0.868 [0.776, 0.937], wrong-sign ≤0.001 (fraction of all 225 worlds, not commits), abstention 0.595; family-holdout 0.607 [0.298, 0.841], wrong-sign 0.087. The gated controller gives 0.8953 vs 0.9443 (improvement 0.049 [0.000, 0.146], lower end zero) and fails under family holdout.
The simulated observations are centered on a training-cell mean, while coverage is scored against each held-out world's branch contrast. Switching to residual resampling produced similar undercoverage, so changing the noise model alone did not resolve this mismatch. Table 7 reports the average per-draw commit probability (0.405 at five observations, hence abstention 0.595); the gate commits when a majority of its 100 draws commits, yielding a 0.369 world-level commit rate. The two rates use different aggregation units and need not coincide.
W3 — Public-task results do not identify persistent authorization
Both public datasets have a one-query horizon, so they cannot identify the long-horizon value of authorization. We add the fixed-view, fixed-packing, fixed-budget ablation; auth-off keeps every visible message authorized, so the eligible set grows and this is not a literal fixed-pool comparison. We repeated the paired comparison at the original per-model answer caps (512, or 1,024 for GLM). All five on-minus-off point estimates remained negative, and only DeepSeek's paired interval excluded zero. Absolute F1 levels did not fully reproduce across runs; the DeepSeek identifier also differed, so we interpret the within-run contrasts and leave the remaining cross-run differences unattributed.
On full LoCoMo the four readers give −0.0320 to −0.0388 with intervals excluding zero. At a matched 12-item budget the full-data differences are about 0.019 F1: LongMemEval-S is a tie for both controls, while on LoCoMo both random and relevance selection are slightly better than lifecycle selection. The paired controls provide no evidence of a QA gain from enabling authorization.
At the fixed 12-item budget the guards authorize 323.9/330.3 tokens and the untransformed control 329.9; the 97.6% refers to the guards' authorized tokens relative to ActMem's full-store 13,343.8. Of the 32 SQCAD-favoring comparisons, 30 are against Memory Worth/Trivium/Oblivion; the two against ActMem are on Terra.
W4 — Baseline and cost evidence support a narrower conclusion
Utility sensitivity, residual uncertainty, and temporal baselines. Appendix B.3 replays frozen actions while varying task value, harm, exposure, probe cost, and storage cost one at a time. Across the tested settings, lineage incurs 8.8–9.8 lower regret than qualification. The harm sweep is uninformative because these frozen actions incur no wrong-use penalty. We have not separately identified the fraction of the residual 0.0634 floor attributable to unavailable future information. The 12-item relevance-only control addresses the retrieval comparison. A capability-preserving temporal-maintenance comparison remains open.
On LongMemEval-S, the reader context rises from 746.2 tokens for the ActMem adapter to 1,644.8–1,713.6 for the SQCAD guards, while physical storage is unchanged.
The displayed rows are matched-contract adapters, not native systems; Table 11 separates evidence tiers. Full LoCoMo implementation checks: A-MEM 0.2710, MemoryOS 0.2266, Mem0 0.0551/0.0445 (Table 12). We do not claim QA SOTA.
Where to find the changes
Tables 3, 6–7 and 11–12, and Appendices A–E; the sections above name the relevant table for each point.