Visualizing, Rethinking, and Mining the Loss Landscape of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
The loss landscape of deep neural networks (DNNs) is commonly considered complex and wildly fluctuated. However, an interesting observation is that the loss surfaces plotted along Gaussian noise directions are almost v-basin ones with the perturbed model lying on the basin. This motivates us to rethink whether the 1D or 2D subspace could cover more complex local geometry structures, and how to mine the corresponding perturbation directions. This paper systematically and gradually categorizes the 1D curves from simple to complex, including v-basin, v-side, w-basin, w-peak, and vvv-basin curves. Notably, the latter two types are already hard to obtain via the intuitive construction of specific perturbation directions, and we need to propose proper mining algorithms to plot the corresponding 1D curves. Combining these 1D directions, various types of 2D surfaces are visualized such as the saddle surfaces and the bottom of a bottle of wine that are only shown by demo functions in previous works. Finally, we propose theoretical insights from the lens of the Hessian matrix to explain the observed several interesting phenomena.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 59 of its 69 references that are in the map. First posted on arXiv 21 May 2024.
Builds on
59 of 69 references.
References · 59
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
38 more
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2017Exploring Generalization in Deep Learningcited by 600
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2020Federated Learning with Matched Averagingcited by 564
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2020What is being transferred in transfer learning?cited by 368
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2016Deep Learning without Poor Local Minimacited by 234
- 2019Model Fusion via Optimal Transportcited by 219
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 159
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 92
- 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
- 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 88
- 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 86
- 2021Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensemblingcited by 75
- 2017The loss surface of deep and wide neural networkscited by 74
- 2019Large Scale Structure of Neural Network Loss Landscapescited by 68
- 2019Visualizing and Understanding the Effectiveness of BERTcited by 67
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2019Understanding Generalization through Visualizationscited by 54
- 2019Emergent properties of the local geometry of neural loss landscapescited by 46
- 2020A Deeper Look at the Hessian Eigenspectrum of Deep Neural Networks and its Applications to Regularizationcited by 44
- 2018On the loss landscape of a class of deep neural networks with no bad local valleyscited by 38
50 most cited of 59 All 59 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.