- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies how a reference established by semantic retrieval can continue to identify the same record as its content and storage location change. It formalizes this requirement as referential stability and shows that revisiting an earlier selection requires retained information about that selection. SLA binds stable identity keys to structured location codes through a shared writable matrix, supporting relocation and relation operations without a separate per-record reverse locator. A forward registry verifies identity before returning the current payload. Because updating one binding can disturb others, the authors derive single-write interference laws for RLS and Delta updates, a cumulative law for Delta, and an exact condition for correct Top-1 decoding. A separate sufficient bound guides bank rebuilding. Experiments show that accurate initialization can mask failures after updates, evaluate maintenance under sustained churn, and verify equivalence to updated pointers on LongMemEval. A frozen DeltaNet integration demonstrates compatibility without additional trainable parameters.
Critical strengths
-
The paper identifies a concrete failure mode that static memory evaluations can miss. Raw semantic keys can decode correctly at initialization yet lose other bindings after a record is relocated. This provides useful evidence that memory quality should be evaluated through updates, with attention to both key geometry and access stability.
-
The analysis connects the update rule to observable access failures. It describes how a write affects other bindings, how these effects accumulate, and when they change the decoded address. The controlled overlap experiments support this explanation. Separating the exact decoding condition from the conservative rebuilding criterion also provides a useful basis for studying the trade-off between reliability and maintenance cost.
Critical weaknesses
1. The case for choosing SLA over an explicit locator remains weak. In the resident-state address-recovery benchmark, cached pointers take 0.113μs and SLA takes 30.898μs; even registry scanning is faster at 20.151μs (Table E.2). Delta-SLA also uses more memory than pointers under the reported common-control accounting (Table E.4). The natural-data experiments establish equivalence to correctly updated pointers, without demonstrating an advantage that compensates for shared-state interference and maintenance. Avoiding a separate reverse locator is a clear design difference, but the paper does not establish a concrete setting where this difference justifies the added complexity.
2. Sustained availability and maintenance cost are insufficiently characterized. The paper correctly distinguishes rejecting an incorrect lookup from successfully accessing an active record. On the high-churn trace, maintaining access requires 1,744 rebuilds for 11,000 candidate writes and increases runtime by 2.13× (Table C.10). In Appendix G’s independent CPU replay, rebuilding every 32 bank writes produces no observed misses with 340 rebuilds. Periodic rebuilding does not provide the same per-commit check, but this comparison leaves the cost-benefit of the guarded policy unresolved. The principal long-horizon maintenance comparison uses one fixed trace, so it remains unclear how failures, rebuild frequency, and latency change across workloads.
Questions for authors
1. Why choose SLA? What concrete system constraint makes an explicit pointer or dictionary unsuitable? Given the reported lookup costs, memory footprint, and equivalence to correctly updated pointers, what benefit justifies SLA’s additional interference and maintenance machinery?
2. Scope of stability. Appendix G provides a check on the correctness of published states. What operating conditions on bank load, key geometry, and update patterns support sustained successful access and continued acceptance of writes? Please clarify the supported operating range, including when rebuilding may fail to produce a certifiable state.
3. Maintenance comparison. In Appendix G’s CPU replay, periodic rebuilding every 32 bank writes has no observed misses with 340 rebuilds, while guarded maintenance uses 1,744. I recognize that these policies provide different guarantees. Can the authors quantify what additional robustness the guarded policy buys, and at what cost, across multiple update traces?
4. Full system cost. Can SLA, periodic rebuilding, and explicit locators be compared on the same mutation workloads, including verification, key generation or caching, maintenance state, and rebuild workspace? Reporting access failures, rejected writes, throughput, tail latency, and peak memory across different loads and churn patterns would help establish where SLA offers a useful trade-off.
6 comments
W2/Q2 - stability and write admission
W2 / Q2: which conditions support sustained successful access and continued writes?
Active access is preserved when committed associations meet the numerical certificate under atomic publication and trusted control metadata. Writes are admitted when the proposed or rebuilt state satisfies the same conditions. Your scope question prompted an explicit account of representability, finite-precision separation, and admission, supported by state-transition tests (Appendices H.2 and H.6).
Representability. With active keys as rows of and assigned unit target codes as rows of , full-row-rank admits the exact-real interpolant
Thus bank load at most key dimension is necessary for full row rank, while the realized key geometry determines rank and conditioning. For ridge regularization,
The Gram spectrum, ridge bias, and target separation jointly determine the attainable margin.
Numerical separation and updates. For unit codes, let be the smallest ideal target-competitor gap and bound response error. The condition preserves the decoded identity before score-rounding terms. The implemented certificate also accounts for actual stored-state reads and score arithmetic, checking all active bindings against the complete codebook. An inconclusive norm-first bound invokes the componentwise check.
Fixed-key residual correction sets the target while preserving other active responses in exact arithmetic. Structural changes update factors and invalidate affected caches. Checking the actual candidate makes publication independent of assumptions about random update order. Rebuilding restores access when it recovers a representable, sufficiently separated state.
Admission preserves the last certified state. Every accepted update is checked before publication. When incompatible duplicate keys, insufficient rank, or inadequate finite-precision separation prevents a certifiable reconstruction, the request receives a defined rejection and the preceding committed state is retained. Retirement and fresh generations prevent old handles from aliasing reused slots. These guarantees apply to atomic or externally locked publication with trusted registry, routing, and liveness metadata.
Long-horizon validation. Three independent 25,000-event streams were run with Incremental and two compiled controls. All nine runs preserve the checked contract: 75,000 distinct input events / 225,000 method events, comprising 101,685 accepted mutations, 11,379 expected rejections, 55,899 handle reads, and 56,037 soft reads. Public checks include cross-bank second-stage failure and clearing stale readouts. Expected rejection is distinguished from an active-reference miss.
High-correlation validation. At 256 active keys, dimension 4096, capacity 1024, and correlation parameters 0.999/0.9999, Read64 retains FP32 state but actually accumulates reads in FP64 before FP32 output. Three seeds per setting and method give 12 passing runs, 384 updates, and 12,288 mixed queries for SLA and Compiled, with zero refits or decoding errors. The output budget remains 0.15, and incompatible duplicate-key controls are still rejected. This is a precision-specific operating result, complementary to the longer lifecycle runs.
The supported operation is now explicit: admit certifiable updates, preserve successful access to the committed associations, and retain that state when a proposal is rejected. We appreciate your request to state these conditions clearly. The theory, actual arithmetic, and long-horizon tests now support the same operating contract.
W2/Q3 - guarding across update traces
W2 / Q3: what additional robustness does guarding buy, and at what cost across traces?
In both three-stream configurations, score and norm guarding preserve all 90,000 measured active-reference reads, while periodic-32 incurs misses. Table H.8 reports the complete cost of obtaining this availability. Your request to test beyond one trace motivated this paired robustness-cost evaluation.
Design. The comparison uses the same native-Delta maintenance policies and numerical settings defined in Appendix G, ensuring that the additional update traces isolate differences in maintenance policy rather than changes in implementation. Each of two configurations uses three independent 25,000-event streams: 20,000 mutations, 5,000 scheduled revisits, and an active-reference read after every event. Policies receive identical inputs within a configuration and seed. Random keys use two banks, initially 48 records per bank, dimension 256, and capacity 128. The correlated configuration uses two banks, initially 64 records, dimension 256, capacity 192, and correlation-generation parameter 0.9. These are two operating configurations, not a single-factor geometry ablation.
Results. Each miss count aggregates 90,000 reads across three streams. Each duration is the median complete cold-service time of those streams.
Random keys: Periodic-32 71 misses / 1.797 s; Periodic-256 3,235 / 1.414 s; score guard 0 / 6.138 s; norm guard 0 / 19.549 s.
Correlated keys: Periodic-32 56,827 misses / 2.258 s; Periodic-256 78,975 / 1.589 s; score guard 0 / 23.130 s; norm guard 0 / 31.705 s.
Identity verification remains enabled. These are unavailable active references, not wrong-record returns. Periodic-32 incurs 24, 21, and 26 misses on the three random streams; both guards eliminate them. Score guard uses 836 versus 1,169 rebuilds in that group, 28.5% fewer than Periodic-32, while still paying per-candidate checking. Compared with norm guard, its complete cost is 68.6% and 27.0% lower in the two configurations.
The update law explains the extra robustness. For initially exact bindings and unit keys, a target-correct Delta write to key gives, for another key (),
The interference term can exhaust another reference's decoding margin after one write, before the next scheduled rebuild. The executable two-record witness starts at decoded addresses [0, 1], reaches [1, 2] after the write, and returns to [0, 2] after rebuilding. The protected record's ideal margin becomes -0.002230638. Candidate verification detects that state before publication under the stated arithmetic assumptions.
Consistency with the reference maintenance experiment. Appendix G retains periodic-32's 340 rebuilds and no observed miss on the original trace. Table C.10 retains the guarded result of 1,744 rebuilds for 11,000 candidate writes at 2.13-times unmaintained runtime. The added streams test robustness across workloads, while the update law explains the protection provided by checking every candidate. The 37,488 correlated score-guard rebuilds characterize the Delta-policy experiment; the geometric Incremental writer has its own service comparisons.
Guarding provides measured active-reference availability on the added independent streams, and the interference law explains how candidate checks protect it between periodic rebuilds. Verification and recovery are included in the reported cost. Thank you for requesting this comparison, which substantially improves the evidence connecting the guarantee to observed operation.
W1/Q1 - why choose SLA?
Thank you for your detailed and insightful assessment of stability and systems cost. Your distinction among safe lookup, active-reference availability, and continued write acceptance provided a valuable structure for the new evaluation. The independent-trace experiments and explicit operating conditions have made the paper substantially stronger.
SLA retains inexpensive pointer-style execution for simple requests and offers certified incremental maintenance with measured service savings. The revision adds the requested multi-trace maintenance comparison, explicit admission conditions, and full cost/resource measurements. Section 4.5 is on pp. 9-10, Figure 4 on p. 9, and Appendix H on pp. 54-66. We address the four questions through complementary evidence on practical deployment, stability conditions, maintenance robustness, and full-system resource costs.
W1 / Q1: what benefit justifies the additional machinery?
The benefit is lower-cost maintenance of changing continuous associations, without imposing matrix maintenance on exact requests. A known handle selects SLA-Direct. Its paired public-service cost ratio to Exact Pointer is 0.9989 [0.9982, 1.0011]. Ordinary SLA-Compiled access gives 0.9950 [0.9844, 1.0102]. Both meet the 2% engineering criterion, with no unused binder or numerical gate in Direct (Appendix H.3-H.4).
Your comparison of exact-access latency and memory costs in Tables E.2 and E.4 correctly highlights the importance of selecting the appropriate execution mechanism for each workload. The 0.113/30.898-microsecond lookup results, registry-scan control, and common-control memory figures remain in Tables E.2 and E.4. SLA-Direct retains exact access without the shared-matrix work, using the same permitted routing and identity information.
Shared maintenance has its own positive evidence. With fixed keys, residual-aware rebinding corrects the target and preserves other active responses in exact arithmetic, using a minimum-Frobenius correction. Geometry is reused and factors are maintained across structural changes. Every stored candidate is certified. At 256 records and dimension 512, independent calibration selects Incremental before evaluation. Across ten input seeds, its complete-service ratio to independent Compiled Readout with the same certificate is 0.8505 [0.8343, 0.8726], or 14.95% lower cost. A separate 62-history controlled study following real session order gives 0.8921 [0.8306, 0.9693], or 10.79% paired savings (Appendix H.2, H.4, H.9).
A continuous application consumes the output. We reproduced the SSP-SLAM View network of Dumont et al. (2023) and confirmed that continuous associative recall contributes directly to the localization feedback pathway. Using the spatial-semantic representations and sensory functions from Dumont et al. (2023), we constructed a controlled closed-loop service in which memory readout influences position correction and subsequent map updates. Every eligible method receives the native identities and weights. Direct-weighted execution satisfies quality in all 960 formal runs and saves 14.58% against same-certificate Compiled Readout, while meeting noninferiority against native aggregation and resolver/gather (Appendix H.5). This measures the benefit of input-appropriate deployment, separately from Incremental's maintenance advantage.
The workload coverage is broader than one trace. The extension spans 24 profiles, varying scale, dimension, update structure, and 1/8/64 reads after each write. All 1,728 validation runs satisfy quality. The four Incremental profiles selected on independent calibration data yield 8.06-16.03% savings with nominal 95% intervals below one. All 20 retained profiles match their references' output, state, and core-call sequences without a per-request proxy (Appendix H.8).
SLA therefore preserves efficient basic execution and adds a certified shared-maintenance realization with measured benefits. Your practical-cost question helped us make this execution choice explicit. The additional theoretical and experimental evidence establishes explicit stability conditions, independently measured active-reference availability, and complete resource costs (Appendices H.6-H.7).