The Butterfly Effect: Neural Network Training Trajectories Are Highly Sensitive to Initial Conditions
Not on the map. Why?
Abstract (arXiv)
Neural network training is inherently sensitive to initialization and the randomness induced by stochastic gradient descent. However, it is unclear to what extent such effects lead to meaningfully different networks, either in terms of the models' weights or the underlying functions that were learned. In this work, we show that during the initial "chaotic" phase of training, even extremely small perturbations reliably causes otherwise identical training trajectories to diverge-an effect that diminishes rapidly over training time. We quantify this divergence through (i) L2 distance between parameters, (ii) the loss barrier when interpolating between networks, (iii) L2 and barrier between parameters after permutation alignment, and (iv) representational similarity between intermediate activations; revealing how perturbations across different hyperparameter or fine-tuning settings drive training trajectories toward distinct loss minima. Our findings provide insights into neural network training stability, with practical implications for fine-tuning, model merging, and diversity of model ensembles.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 61 of its 76 references that are in the map. First posted on arXiv 16 Jun 2025.
Builds on
61 of 76 references.
References · 61
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Layer Normalizationcited by 5,669
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2017Decoupled Weight Decay Regularizationcited by 1,831
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 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
38 more
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2020Federated Learning with Matched Averagingcited by 564
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2020What is being transferred in transfer learning?cited by 368
- 2017Snapshot Ensembles: Train 1, get M for freecited by 350
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
- 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
- 2019Model Fusion via Optimal Transportcited by 219
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 145
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 127
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
- 2020The Early Phase of Neural Network Trainingcited by 115
- 2021Generalized Shape Metrics on Neural Representationscited by 112
- 2021The MultiBERTs: BERT Reproductions for Robustness Analysiscited by 92
- 2021Learning Neural Network Subspacescited by 82
- 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 72
- 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
- 2022Re-basin via implicit Sinkhorn differentiationcited by 62
- 2025Overtrained Language Models Are Harder to Fine-Tunecited by 58
- 2022Linear Connectivity Reveals Generalization Strategiescited by 56
- 2022Mechanistic Mode Connectivitycited by 50
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2023Equivariant Deep Weight Space Alignmentcited by 35
- 2021What can linear interpolation of neural network loss landscapes tell us?cited by 28
- 2022Random initialisations performing above chance and how to find themcited by 23
- 2023Layer-wise Linear Mode Connectivitycited by 22
- 2024The boundary of neural network trainability is fractalcited by 13
- 2022Maximal Initial Learning Rates in Deep ReLU Networkscited by 11
50 most cited of 61 All 61 (JSON)
Built on by
Citing papers per year: 2025: 2; 2026: 7.
9 papers.
- 2026The Appeal and Reality of Recycling LoRAs with Adaptive Mergingcited by 2
- 2026Scaling Linear Mode Connectivity and Merging to Billion Parameter Pretrained Transformerscited by 2
- 2025Entropic Confinement and Mode Connectivity in Overparameterized Neural Networkscited by 1
- 2026How Data Augmentation Shapes Neural Representationscited by 1
- 2026Mapping the Emergence of Regularization-Driven Dynamics in Grokkingcited by 1
- 2025Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Searchcited by 0
- 2026Quasi-Monte Carlo Initialization for Meta-Reinforcement Learningcited by 0
- 2026Learned, Then Lost: A Measured Single-Example Counterfactual in Pre-trainingcited by 0
- 2026When Do Models Admit They Are Wrong? Failure Disclosure Is Unstable Under Reinforcement Learningcited by 0
- 2026When Do Models Admit They Are Wrong? Failure Disclosure Is Unstable Under Reinforcement Learning27 Sep 2026
- 2026Mapping the Emergence of Regularization-Driven Dynamics in Grokking26 Aug 2026
- 2026Learned, Then Lost: A Measured Single-Example Counterfactual in Pre-training19 Aug 2026
- 2026Quasi-Monte Carlo Initialization for Meta-Reinforcement Learning21 Jul 2026
- 2026Scaling Linear Mode Connectivity and Merging to Billion Parameter Pretrained Transformers22 Jun 2026
- 2026How Data Augmentation Shapes Neural Representations14 May 2026
- 2026The Appeal and Reality of Recycling LoRAs with Adaptive Merging12 Feb 2026
- 2025Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search8 Dec 2025
- 2025Entropic Confinement and Mode Connectivity in Overparameterized Neural Networks6 Dec 2025