- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes SHONA, a spike-driven Hopfield associative memory framework for online continual learning. It combines membrane-potential-based retrieval, spike-timing-dependent plasticity for memory updates, and an adaptive forgetting-control mechanism. Experiments on image and event-based datasets evaluate associative retrieval under clean, noisy, and masked inputs, as well as memory preservation during online updates.
Critical strengths
The paper presents a coherent integration of spike-driven retrieval, online plasticity, and forgetting control within an associative memory framework. The evaluation covers multiple datasets and includes comparisons with established associative memory methods.
Critical weaknesses
-
Limited methodological novelty. The main components—membrane-potential-based competition, STDP-inspired memory updates, and activity-dependent forgetting control—are largely established mechanisms. The paper does not clearly demonstrate a fundamentally new associative memory principle arising from their integration.
-
Insufficient evidence of distinctive advantages. The empirical improvements are inconsistent across retrieval conditions, with simpler baselines outperforming SHONA in several settings. Moreover, the experiments do not establish clear computational or neuromorphic benefits, such as improved efficiency, spike sparsity, or energy consumption. Consequently, the significance of introducing spike-driven dynamics remains insufficiently demonstrated.
Questions for authors
-
What specific computational property does SHONA introduce beyond combining existing spiking retrieval, STDP-inspired plasticity, and forgetting-control mechanisms?
-
Can the authors clarify the advantage of spike-driven retrieval over simpler similarity-based methods, particularly given the weaker performance under Gaussian noise reported in Table 3?
-
Does the proposed spike-driven formulation provide measurable computational or efficiency benefits compared with non-spiking alternatives?
2 comments
Answers to Reviewer AjZD — Questions 1–3
Answer to Question 1
As explained in our response to Weakness 1, SHONA's methodological novelty does not require introducing an additional mechanism beyond those identified by the reviewer. It lies in how these mechanisms are mathematically reformulated and integrated for distinct computational purposes within a unified online Hopfield associative-memory architecture (Equations 11–19). In particular, our newly formulated spike-history-driven catastrophic-forgetting control regulates memory modification during continual learning. These contributions are developed in Appendices A.2–A.5, with the forgetting-control mechanism experimentally evaluated in Section 5.3.
Answer to Question 2
As established in our response to Weakness 2, SHONA demonstrates retrieval advantages over MHN and TPAM, including under corrupted cues. Specifically, Table 3a shows that SHONA outperforms MHN at both Gaussian-noise levels, while Appendix A.7.4 demonstrates lower MSE than TPAM. These results show that SHONA's advantages are not limited to masking robustness.
Regarding simpler similarity-based methods, our response to Weakness 2 explains where they achieve lower reconstruction MSE and why substituting geometric retrieval would compromise SHONA's Hopfield foundations (Appendices A.2–A.3). The different effects of Gaussian noise on spike-driven retrieval and geometric similarity are further explained in our response to Reviewer eP1J (Weakness 2).
Answer to Question 3
As clarified in our response to Weakness 2 and Reviewer eP1J (Weakness 1 and Question 4), SHONA does not claim measurable advantages in energy efficiency, latency, or firing sparsity over non-spiking alternatives. These evaluations are explicitly identified as future research directions (Section 6).
SHONA's demonstrated contribution concerns computational capability rather than measured efficiency: binary spike-based representations support Hopfield-style associative retrieval, online memory adaptation, and catastrophic-forgetting control within a unified neural architecture (Sections 3–4). This provides a foundation for extending Hopfield associative memory to neural structures operating through spike-based communication, rather than relying solely on conventional continuous-valued retrieval operations. Experimental support is already detailed in our response to Weakness 2 (Sections 5.2–5.3; Appendix A.7.4).
Response to Reviewer AjZD — Weaknesses 1–2
Response to Weakness 1
We respectfully disagree with the reviewer's assessment that SHONA lacks methodological novelty. SHONA is not a conventional SNN classifier, but an unsupervised, online Hopfield associative-memory architecture that uses spikes, an approach that is missing from the existing literature (Sections 1–2). SHONA draws upon established neural mechanisms but reformulates them for different computational purposes rather than simply applying them to another SNN classifier.
Each mechanism is specifically designed to perform a distinct task required for associative memory: memory selection (Equations 11–13), winner-conditioned consolidation of continuous-valued memory traces (Equations 14–15), and a newly developed spike-history-driven algorithm to regulate catastrophic forgetting (Equations 16–19). Importantly, catastrophic forgetting is an online learning phenomenon, not an existing algorithm copied into SHONA.
Our comparisons with related architectures, including SHONA's superior retrieval performance over another spike-driven associative-memory architecture, TPAM (Appendix A.7.4), further establish the differences in their intended operation and capabilities.
SHONA's methodological novelty lies in the specific mathematical reformulation of these principles and their application to an online Hopfield associative-memory architecture. The reviewer has not identified an existing method using the same learning and memory-control mechanisms, nor provided a specific comparison demonstrating that SHONA's proposed methodology is already established.
Response to Weakness 2
We respectfully disagree that SHONA's distinctive advantages are insufficiently demonstrated. The reviewer appears to evaluate SHONA primarily through reconstruction accuracy, overlooking its contribution as a unified, online spike-driven Hopfield associative-memory architecture (Sections 1–4). This distinction is also addressed in our responses to Reviewer KuNF (Weakness 1 and Question 1) and Reviewer eP1J (Weakness 1 and Question 2).
We included simpler retrieval methods—KNN, Manhattan L1, and cosine similarity (Appendix A.7.1)—to demonstrate where geometric similarity achieves lower MSE. These methods provide effective one-to-one image matching but are not equivalent to neural associative-memory architectures supporting online synaptic adaptation and forgetting control. By utilising geometric similarity, SQHN achieves more favourable retrieval accuracy. However, substituting such a method for SHONA's Hopfield retrieval solely to improve MSE would compromise its energy formulation and conditional exponential-capacity guarantee (Appendices A.2–A.3). Preserving these foundations is a deliberate design choice: our objective is to develop a generalised spike-driven Hopfield memory architecture, rather than another image-search algorithm.
SHONA outperforms MHN in all 24 larger-capacity grayscale comparisons (Section 5.2) and TPAM, an established spike-based associative-memory model, in 475/492 paired retrievals (Appendix A.7.4). Section 5.3 further demonstrates improved retention through our novel catastrophic-forgetting control, alongside masking robustness.
Regarding energy efficiency, latency, and sparsity, we refer to Reviewer eP1J (Weakness 1 and Question 4). These are not claimed advantages but future research directions (Section 6). The energy formulation in Appendix A.2 concerns mathematical Hopfield energy, not electrical consumption.