Identifying Equivalent Training Dynamics
Not on the map. Why?
Abstract (arXiv)
Study of the nonlinear evolution deep neural network (DNN) parameters undergo during training has uncovered regimes of distinct dynamical behavior. While a detailed understanding of these phenomena has the potential to advance improvements in training efficiency and robustness, the lack of methods for identifying when DNN models have equivalent dynamics limits the insight that can be gained from prior work. Topological conjugacy, a notion from dynamical systems theory, provides a precise definition of dynamical equivalence, offering a possible route to address this need. However, topological conjugacies have historically been challenging to compute. By leveraging advances in Koopman operator theory, we develop a framework for identifying conjugate and non-conjugate training dynamics. To validate our approach, we demonstrate that comparing Koopman eigenvalues can correctly identify a known equivalence between online mirror descent and online gradient descent. We then utilize our approach to: (a) identify non-conjugate training dynamics between shallow and wide fully connected neural networks; (b) characterize the early phase of training dynamics in convolutional neural networks; (c) uncover non-conjugate training dynamics in Transformers that do and do not undergo grokking. Our results, across a range of DNN architectures, illustrate the flexibility of our framework and highlight its potential for shedding new light on training dynamics.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 35 of its 76 references that are in the map. First posted on arXiv 17 Feb 2023.
Builds on
35 of 76 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2020What is the State of Neural Network Pruning?cited by 578
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
23 more
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
- 2020The Early Phase of Neural Network Trainingcited by 114
- 2019Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setupcited by 112
- 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
- 2017Critical Learning Periods in Deep Neural Networkscited by 78
- 2014Extracting spatial-temporal coherent patterns in large-scale neural recordings using dynamic mode decompositioncited by 49
- 2021Rigorous data-driven computation of spectral properties of Koopman operators for dynamical systemscited by 44
- 2020Optimizing Neural Networks via Koopman Operator Theorycited by 32
- 2021The Limiting Dynamics of SGD: Modified Loss, Phase Space Oscillations, and Anomalous Diffusioncited by 19
- 2021An Operator Theoretic View on Pruning Deep Neural Networkscited by 18
- 2020Applications of Koopman Mode Analysis to Neural Networkscited by 12
- 2022Non-convex online learning via algorithmic equivalencecited by 10
- 2022On the generalization of learning algorithms that do not convergecited by 9
- 2021Personalized Algorithm Generation: A Case Study in Learning ODE Integratorscited by 8
- 2022A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithmscited by 8
- 2020Accelerating Training in Artificial Neural Networks with Dynamic Mode Decompositioncited by 7
- 2022Algorithmic (Semi-)Conjugacy via Koopman Operator Theorycited by 7
- 2022QuACK: Accelerating Gradient-Based Quantum Optimization with Koopman Operator Learningcited by 7
- 2022Learning to Optimize with Dynamic Mode Decompositioncited by 5
- 2016Optimal Deterministic Algorithm Generationcited by 4
- 2021An automatic system to detect equivalence between iterative algorithmscited by 3
- 2020Transformations between deep neural networkscited by 2
Built on by
Citing papers per year: 2025: 5; 2026: 2.
7 papers.
- 2025The Butterfly Effect: Neural Network Training Trajectories Are Highly Sensitive to Initial Conditionscited by 9
- 2025InputDSA: Demixing then Comparing Recurrent and Externally Driven Dynamicscited by 4
- 2025A Spectral-Grassmann Wasserstein metric for operator representations of dynamical systemscited by 2
- 2026Distributional Spectral Diagnostics for Localizing Grokking Transitionscited by 2
- 2025Finding separatrices of dynamical flows with Deep Koopman Eigenfunctionscited by 1
- 2026Koopman operator theory: fundamentals, control, and applicationscited by 1
- 2025Fast dynamical similarity analysiscited by 0
- 2026Koopman operator theory: fundamentals, control, and applications2 Jul 2026
- 2026Distributional Spectral Diagnostics for Localizing Grokking Transitions7 May 2026
- 2025Fast dynamical similarity analysis28 Nov 2025
- 2025InputDSA: Demixing then Comparing Recurrent and Externally Driven Dynamics29 Oct 2025
- 2025A Spectral-Grassmann Wasserstein metric for operator representations of dynamical systems29 Sep 2025
- 2025The Butterfly Effect: Neural Network Training Trajectories Are Highly Sensitive to Initial Conditions16 Jun 2025
- 2025Finding separatrices of dynamical flows with Deep Koopman Eigenfunctions21 May 2025