Exploring Loss Landscapes through the Lens of Spin Glass Theory
Not on the map. Why?
Abstract (arXiv)
In the past decade, significant strides in deep learning have led to numerous groundbreaking applications. Despite these advancements, the understanding of the high generalizability of deep learning, especially in such an over-parametrized space, remains limited. For instance, in deep neural networks (DNNs), their internal representations, decision-making mechanism, absence of overfitting in an over-parametrized space, superior generalizability, etc., remain less understood. Successful applications are often considered as empirical rather than scientific achievement. This paper delves into the loss landscape of DNNs through the lens of spin glass in statistical physics, a system characterized by a complex energy landscape with numerous metastable states, as a novel perspective in understanding how DNNs work. We investigated the loss landscape of single hidden layer neural networks activated by Rectified Linear Unit (ReLU) function, and introduced several protocols to examine the analogy between DNNs and spin glass. Specifically, we used (1) random walk in the parameter space of DNNs to unravel the structures in their loss landscape; (2) a permutation-interpolation protocol to study the connection between copies of identical regions in the loss landscape due to the permutation symmetry in the hidden layers; (3) hierarchical clustering to reveal the hierarchy among trained solutions of DNNs, reminiscent of the so-called Replica Symmetry Breaking (RSB) phenomenon (i.e. the Parisi solution) in spin glass; (4) finally, we examine the relationship between the ruggedness of DNN's loss landscape and its generalizability, showing an improvement of flattened minima.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 43 of its 73 references that are in the map. First posted on arXiv 30 Jul 2024.
Builds on
43 of 73 references.
References · 43
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2016End to End Learning for Self-Driving Carscited by 1,000
- 2016Universal adversarial perturbationscited by 774
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
- 2023End-to-end Autonomous Driving: Challenges and Frontierscited by 485
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2023Harnessing the Power of LLMs in Practice: A Survey on ChatGPT and Beyondcited by 409
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
31 more
- 2015Deep Knowledge Tracingcited by 328
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2016Deep Learning without Poor Local Minimacited by 233
- 2018Streaming End-to-end Speech Recognition For Mobile Devicescited by 230
- 2014Qualitatively characterizing neural network optimization problemscited by 186
- 2018A mathematical theory of semantic development in deep neural networkscited by 182
- 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 126
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 125
- 2016Identity Matters in Deep Learningcited by 107
- 2023UniverSeg: Universal Medical Image Segmentationcited by 90
- 2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimismcited by 75
- 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 74
- 2021Topic-Driven and Knowledge-Aware Transformer for Dialogue Emotion Detectioncited by 56
- 2018Entropy and mutual information in models of deep neural networkscited by 50
- 2023From high-dimensional & mean-field dynamics to dimensionless ODEs: A unifying approach to SGD in two-layers networkscited by 42
- 2016Unreasonable Effectiveness of Learning Neural Networks: From Accessible States and Robust Ensembles to Basic Algorithmic Schemescited by 40
- 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 36
- 2017Global optimality conditions for deep neural networkscited by 31
- 2022Performative Reinforcement Learningcited by 25
- 2015On the Quality of the Initial Basin in Overspecified Neural Networkscited by 20
- 2017Exponentially vanishing sub-optimal local minima in multilayer neural networkscited by 19
- 2022Understanding Gradient Regularization in Deep Learning: Efficient Finite-Difference Computation and Implicit Biascited by 16
- 2023Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputscited by 16
- 2020Shallow Univariate ReLu Networks as Splines: Initialization, Loss Surface, Hessian, & Gradient Flow Dynamicscited by 13
- 2022Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Networkcited by 10
- 2017Exploring the Function Space of Deep-Learning Machinescited by 7
- 2015Advanced Mean Field Theory of Restricted Boltzmann Machinecited by 3
- 2017Mechanisms of dimensionality reduction and decorrelation in deep neural networkscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 2.
4 papers.
- 2024Symmetry Breaking in Neural Network Optimization: Insights from Input Dimension Expansioncited by 2
- 2026Visualizing the loss landscapes of physics-informed neural networkscited by 1
- 2025Deep Neural Nets as Hamiltonianscited by 0
- 2026An Exploratory Replica-Overlap Probe of the Grokking Transitioncited by 0
- 2026An Exploratory Replica-Overlap Probe of the Grokking Transition22 Sep 2026
- 2026Visualizing the loss landscapes of physics-informed neural networks5 Feb 2026
- 2025Deep Neural Nets as Hamiltonians31 Mar 2025
- 2024Symmetry Breaking in Neural Network Optimization: Insights from Input Dimension Expansion10 Sep 2024