Measuring Structured Predictability in Neural Training Dynamics: A Cross-Regime Study
Not on the map. Why?
Abstract (arXiv)
Modern deep networks are trained through long update trajectories, yet their temporal organization remains less systematically characterized than architectures, losses, or optimizers. We study short-horizon predictability as a measure of temporal redundancy: where, when, and under which training conditions recent updates contain information about near-future parameter motion. We combine three complementary probe families, displacement-direction, subspace-residual, and predictor-based probes, with convention-aware, null-calibrated group-level readouts, and apply them to multi-pass vision training on CIFAR and public Pythia pretraining checkpoints. Across both regimes, vector-like tensors such as normalization parameters and biases (auxiliary parameters) exhibit simpler short-horizon dynamics than matrix-like feature-transforming weights (bulk parameters), whose predictable behavior concentrates in localized, time-varying pockets. Agreement within and across probe families, and with independent trajectory diagnostics, indicates that these measurements capture intrinsic trajectory structure, while probe differences distinguish complementary forms of temporal organization. Controlled CIFAR comparisons further show that architecture and training recipe systematically modulate the measured structure. A Pythia-70M case study further exposes a sequence of role-, depth-, and scale-dependent events, including bulk ESA falling below the random sign-agreement level and the emergence and redistribution of predictable qkv pockets across layers. These results position short-horizon predictability as a retrospective, parameter-resolved diagnostic of training dynamics.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 16 Aug 2026.
Builds on
34 of 47 references.
References · 34
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 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
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2022In-context Learning and Induction Headscited by 964
- 2020On Layer Normalization in the Transformer Architecturecited by 922
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
22 more
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2017Snapshot Ensembles: Train 1, get M for freecited by 350
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 238
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
- 2024Why Transformers Need Adam: A Hessian Perspectivecited by 124
- 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
- 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 72
- 2024LLM Circuit Analyses Are Consistent Across Training and Scalecited by 63
- 2018Quasi-hyperbolic momentum and Adam for deep learningcited by 48
- 2020Coherent Gradients: An Approach to Understanding Generalization in Gradient Descent-based Optimizationcited by 41
- 2020Optimizing Neural Networks via Koopman Operator Theorycited by 33
- 2024Accelerating Training with Neuron Interaction and Nowcasting Networkscited by 12
- 2023XGrad: Boosting Gradient-Based Optimizers With Weight Predictioncited by 5
- 2021Phases of learning dynamics in artificial neural networks: with or without mislabeled datacited by 4
Built on by
Not cited yet.