From the Loss Landscape to Diverse Feature Learning in Neural Networks
Not on the map. Why?
Abstract (arXiv)
Over the course of the last decade, neural networks have grown from an academic curiosity to moving the markets of nations. Despite this explosion in both research and deployment, relatively little is understood about how they achieve the solutions they do. This is both scientifically relevant, and pressing for society. When neural networks make decisions across self-driving, construction, law, hiring and health, there have been and will continue to be unintended consequences. However, attempting to generalize the failures of the largest and most important production systems makes for a very difficult task. Yet signs of these failures exist at all scales of neural networks, so we should be able to study a much more tractable setting. All neural networks must undergo an optimization process, called training, to be useful. To a great degree, understanding neural networks is understanding their optimization: through what process and exposure to which data did they arrive at their results. Yet our knowledge on this topic as a field is quite imprecise. In particular, a curious phenomenon called mode connectivity, the ability to connect neural networks in the loss surface, defies explanation entirely. This dissertation elucidates, explains and exploits this special structure in the loss landscape...
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 69 of its 237 references that are in the map. First posted on arXiv 28 Aug 2026.
Builds on
69 of 237 references.
References · 69
- 2023GPT-4 Technical Reportcited by 18,396
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,585
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2013Intriguing properties of neural networkscited by 5,155
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
38 more
- 2017Decoupled Weight Decay Regularizationcited by 1,831
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 867
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
- 2021Datasets: A Community Library for Natural Language Processingcited by 530
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2023Analyzing and Improving the Training Dynamics of Diffusion Modelscited by 402
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2018Dataset Distillationcited by 230
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
- 2017Searching for Activation Functionscited by 169
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 154
- 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
- 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 123
- 2018Three Mechanisms of Weight Decay Regularizationcited by 113
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
- 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 94
- 2019Robust and interpretable blind image denoising via bias-free convolutional neural networkscited by 90
- 2023Grokking modular arithmeticcited by 83
- 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 72
- 2022Agree to Disagree: Diversity through Disagreement for Better Transferabilitycited by 70
- 2019Weight-space symmetry in deep networks gives rise to permutation saddles, connected by equal-loss valleys across the loss landscapecited by 63
- 2025Skillful joint probabilistic weather forecasting from marginalscited by 63
- 2021No One Representation to Rule Them All: Overlapping Features of Training Methodscited by 58
- 2022Diversify and Disambiguate: Learning From Underspecified Datacited by 56
- 2024Deep Networks Always Grok and Here is Whycited by 51
- 2025Grokking at the Edge of Numerical Stabilitycited by 46
- 2024Approaching Deep Learning through the Spectral Dynamics of Weightscited by 31
- 2023Implicit bias of SGD in L2-regularized linear DNNs: One-way jumps from high to low rankcited by 29
- 2023Proving Linear Mode Connectivity of Neural Networks via Optimal Transportcited by 25
- 2020Revisiting "Qualitatively Characterizing Neural Network Optimization Problems"cited by 24
50 most cited of 69 All 69 (JSON)
Built on by
Not cited yet.