mlsanityData to 14 Oct 2026

Explaining Machine Learning and Memorization with Statistical Mechanics

arXiv 2606.31110 ↗First posted 30 Jun 2026cs.LG cond-mat.stat-mechcited by 0

Not on the map. Why?

Abstract (arXiv)

Artificial neural networks (NNs) and machine learning (ML) algorithms are poorly understood from a theoretical perspective, which makes it difficult to fully realize their potential and overcome their weaknesses. For instance, ML algorithms train NN weights by moving them along a low-dimensional subspace of their allowed values, but this implicitly low-dimensional learning structure is not properly exploited to improve training because its nature is not well understood. Moreover, trained NNs are easily confused by pervasive adversarial attacks whose theoretical underpinnings are still unclear. This thesis aims to improve our theoretical understanding of NNs and ML, with a particular focus on adversarial attacks and implicitly low-dimensional learning. For this purpose, we use mathematical tools from statistical mechanics to study different types of NNs and ways in which they can fit the data. In particular, we study two classes of models that fit the data with various degrees of learning and memorization: dense associative memory (DAM) and restricted Boltzmann machines (RBM). In the process, we investigate connections between different versions of these models that are useful to make analytical investigations more efficient.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 58 of its 237 references that are in the map. First posted on arXiv 30 Jun 2026.

Builds on

58 of 237 references.

References · 58

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  7. 2013Intriguing properties of neural networkscited by 5,155
  8. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  9. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  10. 2016An overview of gradient descent optimization algorithmscited by 1,033
  11. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
  12. 2018Robustness May Be at Odds with Accuracycited by 880
38 more
  1. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  2. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  3. 2020Hopfield Networks is All You Needcited by 475
  4. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
  5. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
  6. 2014The Loss Surfaces of Multilayer Networkscited by 280
  7. 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 278
  8. 2016Dense Associative Memory for Pattern Recognitioncited by 236
  9. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  10. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 201
  11. 2021A Universal Law of Robustness via Isoperimetrycited by 151
  12. 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 148
  13. 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 127
  14. 2020Large Associative Memory Problem in Neurobiology and Machine Learningcited by 112
  15. 2020Optimal Regularization Can Mitigate Double Descentcited by 109
  16. 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 98
  17. 2021Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networkscited by 74
  18. 2018Sparse DNNs with Improved Adversarial Robustnesscited by 72
  19. 2023Energy Transformercited by 71
  20. 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 69
  21. 2020Phase diagram for two-layer ReLU neural networks at infinite-width limitcited by 67
  22. 2020Asymptotics of Ridge (less) Regression under General Source Conditioncited by 62
  23. 2019Splitting Steepest Descent for Growing Neural Architecturescited by 55
  24. 2020A law of robustness for two-layers neural networkscited by 55
  25. 2021Learning Gaussian Mixtures with Generalised Linear Models: Precise Asymptotics in High-dimensionscited by 54
  26. 2020Modern Hopfield Networks and Attention for Immune Repertoire Classificationcited by 53
  27. 2020Multiple Descent: Design Your Own Generalization Curvecited by 45
  28. 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 38
  29. 2019Semi-flat minima and saddle points by embedding neural networks to overparameterizationcited by 30
  30. 2019Batch Normalization is a Cause of Adversarial Vulnerabilitycited by 29
  31. 2022On the Adversarial Robustness of Mixture of Expertscited by 28
  32. 2023Improved Discretization Analysis for Underdamped Langevin Monte Carlocited by 28
  33. 2014On the saddle point problem for non-convex optimizationcited by 20
  34. 2018With Friends Like These, Who Needs Adversaries?cited by 19
  35. 2019Energy-Aware Neural Architecture Optimization with Fast Splitting Steepest Descentcited by 18
  36. 2025Modern Methods in Associative Memorycited by 15
  37. 2021On the interplay between data structure and loss function in classification problemscited by 13
  38. 2023Memory in Plain Sight: Surveying the Uncanny Resemblances of Associative Memories and Diffusion Modelscited by 13

50 most cited of 58 All 58 (JSON)

Built on by

Not cited yet.