Self-attention as an attractor network: transient memories without backpropagation
Not on the map. Why?
Abstract (arXiv)
Transformers are one of the most successful architectures of modern neural networks. At their core there is the so-called attention mechanism, which recently interested the physics community as it can be written as the derivative of an energy function in certain cases: while it is possible to write the cross-attention layer as a modern Hopfield network, the same is not possible for the self-attention, which is used in the GPT architectures and other autoregressive models. In this work we show that it is possible to obtain the self-attention layer as the derivative of local energy terms, which resemble a pseudo-likelihood. We leverage the analogy with pseudo-likelihood to design a recurrent model that can be trained without backpropagation: the dynamics shows transient states that are strongly correlated with both train and test examples. Overall we present a novel framework to interpret self-attention as an attractor network, potentially paving the way for new theoretical approaches inspired from physics to understand transformers.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 21 references that are in the map. First posted on arXiv 24 Sep 2024.
Builds on
10 of 21 references.
References · 10
- 2017Attention Is All You Needcited by 59,932
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2016Layer Normalizationcited by 5,579
- 2020Hopfield Networks is All You Needcited by 461
- 2023Spontaneous Symmetry Breaking in Generative Diffusion Modelscited by 74
- 2019Overparameterized Neural Networks Implement Associative Memorycited by 45
- 2023In search of dispersed memories: Generative diffusion models are associative memory networkscited by 44
- 2017Inverse statistical problems: from the inverse Ising problem to data sciencecited by 36
- 2023Mapping of attention mechanisms to a generalized Potts modelcited by 19
- 2024Random Features Hopfield Networks generalize retrieval to previously unseen examplescited by 8
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Pseudo-likelihood produces associative memories able to generalize, even for asymmetric couplingscited by 2
- 2025A Differential Manifold Perspective and Universality Analysis of Continuous Attractors in Artificial Neural Networkscited by 0
- 2026Balancing Fidelity and Diversity in Diffusion Models via Symmetric Attention Decomposition: Hopfield Perspectivecited by 0
- 2026Balancing Fidelity and Diversity in Diffusion Models via Symmetric Attention Decomposition: Hopfield Perspective26 May 2026
- 2025A Differential Manifold Perspective and Universality Analysis of Continuous Attractors in Artificial Neural Networks3 Sep 2025
- 2025Pseudo-likelihood produces associative memories able to generalize, even for asymmetric couplings7 Jul 2025