mlsanityData to 14 Oct 2026

Deep Learning Through A Telescoping Lens: A Simple Model Provides Empirical Insights On Grokking, Gradient Boosting & Beyond

arXiv 2411.00247 ↗First posted 31 Oct 2024cs.LG cs.AI stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

Deep learning sometimes appears to work in unexpected ways. In pursuit of a deeper understanding of its surprising behaviors, we investigate the utility of a simple yet accurate model of a trained neural network consisting of a sequence of first-order approximations telescoping out into a single empirically operational tool for practical analysis. Across three case studies, we illustrate how it can be applied to derive new empirical insights on a diverse range of prominent phenomena in the literature -- including double descent, grokking, linear mode connectivity, and the challenges of applying deep learning on tabular data -- highlighting that this model allows us to construct and extract metrics that help predict and understand the a priori unexpected performance of neural networks. We also demonstrate that this model presents a pedagogical formalism allowing us to isolate components of the training process even in complex contemporary settings, providing a lens to reason about the effects of design choices such as architecture & optimization strategy, and reveals surprising parallels between neural network learning and gradient boosting.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 77 of its 103 references that are in the map. First posted on arXiv 31 Oct 2024.

Builds on

77 of 103 references.

References · 77

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  5. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  7. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  8. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  9. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  10. 2018On Lazy Training in Differentiable Programmingcited by 675
  11. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  12. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
38 more
  1. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  2. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  3. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
  4. 2019Benign Overfitting in Linear Regressioncited by 549
  5. 2014OpenML: networked science in machine learningcited by 526
  6. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  7. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  8. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
  9. 2020What is being transferred in transfer learning?cited by 368
  10. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
  11. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
  12. 2017High-dimensional dynamics of generalization error in neural networkscited by 241
  13. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
  14. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  15. 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
  16. 2019Model Fusion via Optimal Transportcited by 219
  17. 2019Two models of double descent for weak featurescited by 195
  18. 2022Patching open-vocabulary models by interpolating weightscited by 190
  19. 2018To understand deep learning we need to understand kernel learningcited by 187
  20. 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
  21. 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
  22. 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
  23. 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
  24. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  25. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  26. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 132
  27. 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
  28. 2023Explaining grokking through circuit efficiencycited by 111
  29. 2022Fusing finetuned models for better pretrainingcited by 110
  30. 2020Optimal Regularization Can Mitigate Double Descentcited by 109
  31. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
  32. 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
  33. 2020Double Trouble in Double Descent : Bias and Variance(s) in the Lazy Regimecited by 95
  34. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 94
  35. 2019Limitations of Lazy Training of Two-layers Neural Networkscited by 87
  36. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  37. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 80
  38. 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 76

50 most cited of 77 All 77 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 3.

9 papers.