A Biologically Plausible Dense Associative Memory with Exponential Capacity
Not on the map. Why?
Abstract (arXiv)
Krotov and Hopfield (2021) proposed a biologically plausible two-layer associative memory network with memory storage capacity exponential in the number of visible neurons. However, the capacity was only linear in the number of hidden neurons. This limitation arose from the choice of nonlinearity between the visible and hidden units, which enforced winner-take-all dynamics in the hidden layer, thereby restricting each hidden unit to encode only a single memory. We overcome this limitation by introducing a novel associative memory network with a threshold nonlinearity that enables distributed representations. In contrast to winner-take-all dynamics, where each hidden neuron is tied to an entire memory, our network allows hidden neurons to encode basic components shared across many memories. Consequently, complex patterns are represented through combinations of hidden neurons. These representations reduce redundancy and allow many correlated memories to be stored compositionally. Thus, we achieve much higher capacity: exponential in the number of hidden units, provided the number of visible units is sufficiently large relative to the number of hidden units. Exponential capacity arises because all binary states of the hidden units can become stable memory patterns. Moreover, the distributed hidden representation, which has much lower dimensionality than the visible layer, preserves class-discriminative structure, supporting efficient nonlinear decoding. These results establish a new regime for associative memory, enabling high-capacity, robust, and scalable architectures consistent with biological constraints.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Jan 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026On the Infinite Width and Depth Limits of Predictive Coding Networkscited by 2
- 2026Energy-Based Dynamical Models for Neurocomputation, Learning, and Optimizationcited by 1
- 2026Algorithmic Analysis of Dense Associative Memory: Finite-Size Guarantees and Adversarial Robustnesscited by 0
- 2026Context-Gated Associative Retrieval: From Theory to Transformerscited by 0
- 2026Phases in a class of associative memories via hidden neuronscited by 0
- 2026Hierarchical Prototype Emergence in Modern Hopfield Modelscited by 0
- 2026Hierarchical Prototype Emergence in Modern Hopfield Models10 Sep 2026
- 2026Phases in a class of associative memories via hidden neurons10 Sep 2026
- 2026Context-Gated Associative Retrieval: From Theory to Transformers8 May 2026
- 2026Algorithmic Analysis of Dense Associative Memory: Finite-Size Guarantees and Adversarial Robustness14 Apr 2026
- 2026Energy-Based Dynamical Models for Neurocomputation, Learning, and Optimization6 Apr 2026
- 2026On the Infinite Width and Depth Limits of Predictive Coding Networks7 Feb 2026