Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models
Not on the map. Why?
Abstract (arXiv)
We propose a two-stage memory retrieval dynamics for modern Hopfield models, termed mathttU-Hop, with enhanced memory capacity. Our key contribution is a learnable feature map Phi which transforms the Hopfield energy function into kernel space. This transformation ensures convergence between the local minima of energy and the fixed points of retrieval dynamics within the kernel space. Consequently, the kernel norm induced by Phi serves as a novel similarity measure. It utilizes the stored memory patterns as learning data to enhance memory capacity across all modern Hopfield models. Specifically, we accomplish this by constructing a separation loss L_Phi that separates the local minima of kernelized energy by separating stored memory patterns in kernel space. Methodologically, mathttU-Hop memory retrieval process consists of: (Stage I) minimizing separation loss for a more uniform memory (local minimum) distribution, followed by (Stage II) standard Hopfield energy minimization for memory retrieval. This results in a significant reduction of possible metastable states in the Hopfield energy function, thus enhancing memory capacity by preventing memory confusion. Empirically, with real-world datasets, we demonstrate that mathttU-Hop outperforms all existing modern Hopfield models and state-of-the-art similarity measures, achieving substantial improvements in both associative memory retrieval and deep learning tasks. Code is available at https://github.com/MAGICS-LAB/UHop ; future updates are on arXiv:2404.03827
Key facts. Cited by 38 papers in the map (data through 14 Oct 2026). Builds on 39 of its 64 references that are in the map. First posted on arXiv 4 Apr 2024.
Builds on
39 of 64 references.
References · 39
- 2017Attention Is All You Needcited by 60,361
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2020Hopfield Networks is All You Needcited by 475
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 341
- 2024Massive Activations in Large Language Modelscited by 294
- 2016Dense Associative Memory for Pattern Recognitioncited by 236
- 2019Adaptively Sparse Transformerscited by 155
- 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 151
- 2021Understanding and Overcoming the Challenges of Efficient Transformer Quantizationcited by 141
27 more
- 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 130
- 2020Large Associative Memory Problem in Neurobiology and Machine Learningcited by 112
- 2023Fast Attention Requires Bounded Entriescited by 102
- 2022Understanding Contrastive Learning Requires Incorporating Inductive Biasescited by 96
- 2020Low-Rank Bottleneck in Multi-head Attention Modelscited by 89
- 2021CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIPcited by 89
- 2021Skyformer: Remodel Self-Attention with Gaussian Kernel and Nystr"om Methodcited by 63
- 2022Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Modelscited by 55
- 2020Modern Hopfield Networks and Attention for Immune Repertoire Classificationcited by 53
- 2021Associative Memories via Predictive Codingcited by 44
- 2023How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computationcited by 44
- 2023Conformal Prediction for Time Series with Modern Hopfield Networkscited by 42
- 2024On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysiscited by 41
- 2023Scaling Laws for Associative Memoriescited by 35
- 2023STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Predictioncited by 35
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
- 2024The Fine-Grained Complexity of Gradient Computation for Training Large Language Modelscited by 30
- 2021Biological learning in key-value memory networkscited by 18
- 2023Simplicial Hopfield networkscited by 16
- 2024Learning Associative Memories with Gradient Descentcited by 16
- 2022BayesPCN: A Continually Learnable Predictive Coding Associative Memorycited by 14
- 2020Implicit Kernel Attentioncited by 13
- 2022Kernel Memory Networks: A Unifying Framework for Memory Modelingcited by 12
- 2019Meta-Learning Deep Energy-Based Memory Modelscited by 11
- 2023Storage and Learning phase transitions in the Random-Features Hopfield Modelcited by 11
- 2023Feature Programming for Multivariate Time Series Predictioncited by 7
- 2024Bridging Associative Memory and Probabilistic Modelingcited by 5
Built on by
Citing papers per year: 2024: 21; 2025: 13; 2026: 4.
38 papers.
Sort:
By area:
- 2024nGPT: Normalized Transformer with Representation Learning on the Hyperspherecited by 70
- 2024Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Modelscited by 31
- 2024Circuit Complexity Bounds for RoPE-based Transformer Architecturecited by 26
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
- 2024Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descentcited by 22
- 2024Conv-CoA: Improving Open-domain Question Answering in Large Language Models via Conversational Chain-of-Actioncited by 19
- 2024A Tighter Complexity Analysis of SparseGPTcited by 19
- 2024HSR-Enhanced Sparse Attention Accelerationcited by 19
- 2024Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codescited by 19
- 2024Nonparametric Modern Hopfield Modelscited by 16
- 2024Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformerscited by 15
- 2024Provable Differentially Private Computation of the Cross-Attention Mechanismcited by 14
26 more
- 2024Beyond Scaling Laws: Understanding Transformer Performance with Associative Memorycited by 12
- 2024Theoretical Constraints on the Expressive Power of mathsfRoPE-based Tensor Attention Transformerscited by 12
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolationcited by 11
- 2025Dense Associative Memory with Epanechnikov Energycited by 11
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flowscited by 10
- 2024Decoupled Alignment for Robust Plug-and-Play Adaptationcited by 9
- 2024Modern Hopfield Networks Require Chain-of-Thought to Solve mathsfNC1-Hard Problemscited by 9
- 2024Dense Associative Memory Through the Lens of Random Featurescited by 8
- 2025Fast and Low-Cost Genomic Foundation Models via Outlier Removalcited by 8
- 2025In-context denoising with one-layer transformers: connections between attention and associative memory retrievalcited by 7
- 2024Unlocking the Theory Behind Scaling 1-Bit Neural Networkscited by 4
- 2025Neural Algorithmic Reasoning for Hypergraphs with Looped Transformerscited by 4
- 2024Differentially Private Kernel Density Estimationcited by 3
- 2025Transformers as Intrinsic Optimizers: Forward Inference through the Energy Principlecited by 3
- 2025Hyper-SET: Designing Transformers via Hyperspherical Energy Minimizationcited by 2
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiencycited by 2
- 2025Dense associative memory for Gaussian distributionscited by 2
- 2024Binary Hypothesis Testing for Softmax Models and Leverage Score Modelscited by 1
- 2025Adaptive Hopfield Network: Rethinking Similarities in Associative Memorycited by 1
- 2025On the Role of Hidden States of Modern Hopfield Network in Transformercited by 1
- 2024Modern Hopfield Networks meet Encoded Neural Representations -- Addressing Practical Considerationscited by 0
- 2025Effects of Feature Correlations on Associative Memory Capacitycited by 0
- 2026Vision Hopfield Memory Networks for Image Recognitioncited by 0
- 2026Hyperbolic Neural Population Geometry Benefits Computationcited by 0
- 2026Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memoriescited by 0
- 2026SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrievalcited by 0
- 2026SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval1 Sep 2026
- 2026Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories9 Jun 2026
- 2026Hyperbolic Neural Population Geometry Benefits Computation8 Jun 2026
- 2026Vision Hopfield Memory Networks for Image Recognition26 Mar 2026
- 2025Adaptive Hopfield Network: Rethinking Similarities in Associative Memory25 Nov 2025
- 2025On the Role of Hidden States of Modern Hopfield Network in Transformer24 Nov 2025
- 2025Transformers as Intrinsic Optimizers: Forward Inference through the Energy Principle2 Nov 2025
- 2025Dense associative memory for Gaussian distributions27 Sep 2025
- 2025Effects of Feature Correlations on Associative Memory Capacity2 Aug 2025
- 2025Dense Associative Memory with Epanechnikov Energy12 Jun 2025
- 2025Fast and Low-Cost Genomic Foundation Models via Outlier Removal1 May 2025
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency18 Mar 2025
26 more
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows12 Mar 2025
- 2025Hyper-SET: Designing Transformers via Hyperspherical Energy Minimization17 Feb 2025
- 2025In-context denoising with one-layer transformers: connections between attention and associative memory retrieval7 Feb 2025
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation1 Feb 2025
- 2025Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers18 Jan 2025
- 2024Theoretical Constraints on the Expressive Power of mathsfRoPE-based Tensor Attention Transformers23 Dec 2024
- 2024Modern Hopfield Networks Require Chain-of-Thought to Solve mathsfNC1-Hard Problems7 Dec 2024
- 2024Circuit Complexity Bounds for RoPE-based Transformer Architecture12 Nov 2024
- 2024Unlocking the Theory Behind Scaling 1-Bit Neural Networks3 Nov 2024
- 2024Dense Associative Memory Through the Lens of Random Features31 Oct 2024
- 2024Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes30 Oct 2024
- 2024Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent15 Oct 2024
- 2024HSR-Enhanced Sparse Attention Acceleration14 Oct 2024
- 2024nGPT: Normalized Transformer with Representation Learning on the Hypersphere1 Oct 2024
- 2024Modern Hopfield Networks meet Encoded Neural Representations -- Addressing Practical Considerations24 Sep 2024
- 2024Differentially Private Kernel Density Estimation3 Sep 2024
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time23 Aug 2024
- 2024A Tighter Complexity Analysis of SparseGPT22 Aug 2024
- 2024Provable Differentially Private Computation of the Cross-Attention Mechanism20 Jul 2024
- 2024Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformers26 Jun 2024
- 2024Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models5 Jun 2024
- 2024Decoupled Alignment for Robust Plug-and-Play Adaptation3 Jun 2024
- 2024Conv-CoA: Improving Open-domain Question Answering in Large Language Models via Conversational Chain-of-Action28 May 2024
- 2024Beyond Scaling Laws: Understanding Transformer Performance with Associative Memory14 May 2024
- 2024Binary Hypothesis Testing for Softmax Models and Leverage Score Models9 May 2024
- 2024Nonparametric Modern Hopfield Models5 Apr 2024
- 2024Provable Differentially Private Computation of the Cross-Attention Mechanismcited by 14
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolationcited by 11
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flowscited by 10
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiencycited by 2
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency18 Mar 2025
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows12 Mar 2025
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation1 Feb 2025
- 2024Provable Differentially Private Computation of the Cross-Attention Mechanism20 Jul 2024
- 2024Decoupled Alignment for Robust Plug-and-Play Adaptationcited by 9
- 2024Decoupled Alignment for Robust Plug-and-Play Adaptation3 Jun 2024
- 2026Vision Hopfield Memory Networks for Image Recognitioncited by 0
- 2026Vision Hopfield Memory Networks for Image Recognition26 Mar 2026
- 2024nGPT: Normalized Transformer with Representation Learning on the Hyperspherecited by 70
- 2024Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Modelscited by 31
- 2024Circuit Complexity Bounds for RoPE-based Transformer Architecturecited by 26
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
- 2024Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descentcited by 22
- 2024Conv-CoA: Improving Open-domain Question Answering in Large Language Models via Conversational Chain-of-Actioncited by 19
- 2024A Tighter Complexity Analysis of SparseGPTcited by 19
- 2024HSR-Enhanced Sparse Attention Accelerationcited by 19
- 2024Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codescited by 19
- 2024Nonparametric Modern Hopfield Modelscited by 16
- 2024Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformerscited by 15
- 2024Beyond Scaling Laws: Understanding Transformer Performance with Associative Memorycited by 12
12 most cited of 31 All 31 (JSON)
- 2026SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval1 Sep 2026
- 2026Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories9 Jun 2026
- 2026Hyperbolic Neural Population Geometry Benefits Computation8 Jun 2026
- 2025Adaptive Hopfield Network: Rethinking Similarities in Associative Memory25 Nov 2025
- 2025On the Role of Hidden States of Modern Hopfield Network in Transformer24 Nov 2025
- 2025Transformers as Intrinsic Optimizers: Forward Inference through the Energy Principle2 Nov 2025
- 2025Dense associative memory for Gaussian distributions27 Sep 2025
- 2025Effects of Feature Correlations on Associative Memory Capacity2 Aug 2025
- 2025Dense Associative Memory with Epanechnikov Energy12 Jun 2025
- 2025Fast and Low-Cost Genomic Foundation Models via Outlier Removal1 May 2025
- 2025Hyper-SET: Designing Transformers via Hyperspherical Energy Minimization17 Feb 2025
- 2025In-context denoising with one-layer transformers: connections between attention and associative memory retrieval7 Feb 2025
12 newest of 31 All 31 (JSON)