mlsanityData to 7 Oct 2026

Dense Hopfield Networks in the Teacher-Student Setting

arXiv 2401.04191 ↗First posted 8 Jan 2024cond-mat.dis-nn cs.LG math-phcited by 4

Not on the map. Why?

Abstract (arXiv)

Dense Hopfield networks are known for their feature to prototype transition and adversarial robustness. However, previous theoretical studies have been mostly concerned with their storage capacity. We bridge this gap by studying the phase diagram of p-body Hopfield networks in the teacher-student setting of an unsupervised learning problem, uncovering ferromagnetic phases reminiscent of the prototype and feature learning regimes. On the Nishimori line, we find the critical size of the training set necessary for efficient pattern retrieval. Interestingly, we find that that the paramagnetic to ferromagnetic transition of the teacher-student setting coincides with the paramagnetic to spin-glass transition of the direct model, i.e. with random patterns. Outside of the Nishimori line, we investigate the learning performance in relation to the inference temperature and dataset noise. Moreover, we show that using a larger p for the student than the teacher gives the student an extensive tolerance to noise. We then derive a closed-form expression measuring the adversarial robustness of such a student at zero temperature, corroborating the positive correlation between number of parameters and robustness observed in large neural networks. We also use our model to clarify why the prototype phase of modern Hopfield networks is adversarially robust.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 28 of its 83 references that are in the map. First posted on arXiv 8 Jan 2024.

Builds on

28 of 83 references.

References · 28

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2013Intriguing properties of neural networkscited by 5,114
  4. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  5. 2018Robustness May Be at Odds with Accuracycited by 873
  6. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  7. 2020Hopfield Networks is All You Needcited by 461
  8. 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 275
  9. 2016Dense Associative Memory for Pattern Recognitioncited by 230
  10. 2021A Universal Law of Robustness via Isoperimetrycited by 150
  11. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  12. 2020Large Associative Memory Problem in Neurobiology and Machine Learningcited by 110
16 more
  1. 2021Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networkscited by 73
  2. 2023Energy Transformercited by 69
  3. 2020A law of robustness for two-layers neural networkscited by 54
  4. 2020Modern Hopfield Networks and Attention for Immune Repertoire Classificationcited by 52
  5. 2017Dense Associative Memory is Robust to Adversarial Inputscited by 45
  6. 2023In search of dispersed memories: Generative diffusion models are associative memory networkscited by 44
  7. 2022On the Adversarial Robustness of Mixture of Expertscited by 27
  8. 2017Phase Diagram of Restricted Boltzmann Machines and Generalised Hopfield Networks with Arbitrary Priorscited by 25
  9. 2022Overparameterized Linear Regression under Adversarial Attackscited by 21
  10. 2016Phase transitions in Restricted Boltzmann Machines with generic priorscited by 20
  11. 2018With Friends Like These, Who Needs Adversaries?cited by 18
  12. 2019Minimal model of permutation symmetry in unsupervised learningcited by 13
  13. 2019Neural networks with redundant representation: detecting the undetectablecited by 12
  14. 2018Glassy nature of the hard phase in inference problemscited by 9
  15. 2023Hopfield model with planted patterns: a teacher-student self-supervised learning modelcited by 7
  16. 2023A Waddington landscape for prototype learning in generalized Hopfield networkscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.