Adaptive Hopfield Network: Rethinking Similarities in Associative Memory
Shurong Wang, Yuqi Pan, Zhuoyang Shen, Meng Zhang, Hongwei Wang, Guoqi Li

TL;DR
This paper introduces an adaptive similarity mechanism for Hopfield networks that models context-dependent generative processes, leading to improved retrieval accuracy and state-of-the-art performance across various tasks.
Contribution
It proposes a novel adaptive similarity measure that learns to approximate likelihoods for correct retrieval, enhancing associative memory models beyond fixed similarity measures.
Findings
Achieves optimal correct retrieval for noisy, masked, and biased variants.
Demonstrates state-of-the-art performance in memory retrieval and classification tasks.
Provides theoretical guarantees for adaptive similarity effectiveness.
Abstract
Associative memory models are content-addressable memory systems fundamental to biological intelligence and are notable for their high interpretability. However, existing models evaluate the quality of retrieval based on proximity, which cannot guarantee that the retrieved pattern has the strongest association with the query, failing correctness. We reframe this problem by proposing that a query is a generative variant of a stored memory pattern, and define a variant distribution to model this subtle context-dependent generative process. Consequently, correct retrieval should return the memory pattern with the maximum a posteriori probability of being the query's origin. This perspective reveals that an ideal similarity measure should approximate the likelihood of each stored pattern generating the query in accordance with variant distribution, which is impossible for fixed and…
Peer Reviews
Decision·ICLR 2026 Poster
1. The paper's first strength lies in its novel reframing of the retrieval problem in associative memories through a probabilistic framework, and go beyond traditional epsilon-retrieval to a new concept term as "correct retrieval". The goal becomes finding the memory pattern that is the most probable origin of the query, based on a clear mathematical definition: maximizing the a posteriori probability 2. The authors demonstrate that A-Hop achieves state-of-the-art performance across a diverse s
1. My main concern is whether the proposed similarity footprint and adaptive similarity, $s(\xi,x) = w^{\top}U\tilde{q}$, can approximate the posterior distribution, about which the author spends a whole subsection (3.1) discussing the novelty of framing the retrieval problem in this probabilistic way. Maybe I miss some part of the content, but I feel like it lacks a strong theoretical justification for why this specific basis (a linear combination of cumulative sums of sorted dimension-wise sim
The beginning of the paper was on the right track in terms of addressing a problem since the current limitation of Hopfield networks was their ability to handle conceptual variants of the stored patterns. Modeling the query as a generative variant of the store patterns is also reasonable. Experimental results are indicating that the technique works under the modeled transformations of stored patterns. The proofs of the theorems are provided in the appendix which adds to some of the clarification
While the approach was well-motivated, the method presented was a bit under-whelming. Why would sorting along each dimensions help in finding similarity. It is also known that such operations can bring dis-similar vectors close together as well and create distractions. The tabular results are too abstract to interpret and not enough time is devoted in the paper. Having an illustration of the method through visual examples in case of image retrieval would strengthen the understanding of the meth
- Tackles a fundamental issue (retrieval correctness vs. proximity) with a clear probabilistic framework. - Offers theoretical guarantees for optimal retrieval under well-defined generative scenarios (noise, masking, bias). I skimmed through the proofs. Looks reasonable to me, but I didn't check them line-by-line. - Extensive experiments across diverse tasks, showing consistent improvements over strong baselines. Code provided. I skimmed through them. Looks reasonable to me. I didn't check li
1. [major] Incremental novelty: Core idea is essentially learning a weighted distance (metric learning) for Hopfield retrieval similar to Wu & Hu et al 2024. It is a relatively straightforward extension of known concepts. 2. [minor] Theory vs. implementation gap: Proofs assume per-dimension weighting (unsorted footprint) for optimal retrieval, but the actual method uses sorted feature footprints without a formal optimality guarantee for that sorting. Please correct me if I am wrong. 3. [minor]
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFerroelectric and Negative Capacitance Devices · Neural Networks and Applications · Memory and Neural Mechanisms
