- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes ENCORE, an online associative memory system that optimizes each incoming pattern’s internal encoding before storage. Inspired by hippocampal memory allocation, it combines dimensionality expansion and sparse coding with iterative encoding optimization that balances input fidelity, neuron usage, and interference with existing memories. The selected codes are stored using local learning rules. Experiments on synthetic patterns, MNIST, and ImageNet latents report increased online retrieval capacity, while ablations indicate complementary benefits from usage balancing and interference reduction.
Critical strengths
- The paper explicitly incorporates memory history into the selection of new codes, balancing input fidelity, neuron usage, and interference. This provides a useful perspective complementary to improvements in retrieval dynamics and storage rules.
- The design connects dimensionality expansion, sparse coding, adaptive neuron allocation, and recurrent pattern completion. The encoding objective has interpretable computational components, while Hebbian and delta-rule updates establish associations between inputs and selected code.
- The expansion-only control helps isolate the benefits of encoding optimization. Additional analyses of neuron usage and code overlap provide evidence for the distinct, complementary roles of allocation balancing and interference reduction.
Critical weaknesses
- The MHN comparison does not fully establish the scope of the claimed advantage. The baseline updates its memory matrix through backpropagation using only the current sample, making it susceptible to forgetting. This evaluates a particular online learning strategy rather than MHN retrieval more broadly. Stronger online MHN baselines under an explicit storage budget, or clearer justification of the chosen protocol, are needed to support the comparison.
- The computational and storage costs of the capacity gains are insufficiently characterized. ENCORE introduces iterative encoding search and additional encoding and decoding matrices. Although the expansion-only ablation supports the value of encoding optimization, the paper does not report runtime, memory usage, or sensitivity to the iteration budget. It therefore remains unclear whether the advantage persists under comparable resource budgets.
Questions for authors
- The encoding ablations provide promising evidence. Could the authors justify the current-sample-only MHN training protocol and test whether the gains persist against stronger online MHN baselines under a matched storage budget?
- The capacity gains are substantial. What additional encoding time and storage do they require, and how does the capacity–cost tradeoff change with the encoding iteration budget?
Justification for the MHN protocol, added stronger baselines, iteration budget sweep and matched storage capacity
Thank you for the detailed comments. We have added stronger online MHN baselines with explicit storage budgets, a cost analysis and a sweep of the iteration budget.
Q1) Justify the current-sample-only MHN protocol
Please see Section 2.1 of the Author Response.
Q2) Test stronger online MHN baselines under a matched storage budget
Please see Section 2.2 of the Author Response.
Q3) What additional encoding time and storage do the gains require, and how does the capacity–cost trade-off change with the iteration budget?
One iteration is sufficient. Pattern-retrieval capacity varies by at most 5% for Tγ≥1, and code-retrieval capacity is highest at Tγ=1. A larger budget adds time and no capacity, so the best trade-off is Tγ=1:. The same holds on MNIST and ImageNet latents (Table 6). All initial experiments used Tγ=5, the paper now mention this in Sec. 2.4.
Q4) Does the advantage persist under comparable resource budgets?
Please see Section 3.4 of the Author Response.
Thank you for your constructive feedback and informative review! Please let us know if there's anything that you'd like to discuss!