mlsanityData to 14 Oct 2026

Tunneling the Loss Landscape: Bypassing Memorization with Monte Carlo Parameter Swapping

arXiv 2608.01833 ↗First posted 3 Aug 2026cond-mat.dis-nn cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Grokking is a striking phenomenon in neural network training, where a model can undergo a prolonged period of pure memorization before abrupt generalization. While previous works have attempted to interpret it through classical machine learning mechanisms like weight norm, recent research draws an analogy from statistical physics, framing grokking as a form of computational glass relaxation. This theory defines the initial memorization as a result of `fast cooling' where the training loss is reduced so quickly that a glass state is formed, followed by a `slow relaxation' towards final generalization. Although providing a unifying framework for representative grokking theories, this perspective has remained largely at the theoretical on macroscopic level without direct empirical validation on training dynamics. Here we introduce a three-component framework to directly characterize the training dynamics via parameter mobility (PM), and two representative measurements from glassy dynamics: replica correlation (RC) and fractal dimension (FD). We demonstrate that standard optimization presents clear signatures of glass dynamics and inherently traps the grokking network in a kinetic arrested memorization state with a collapsed mobility, strong history dependence, and channel-like motions. This quantitative agreement motivates us to introduce State-Aware Monte Carlo Parameter Swapping (SAM-Swap), an optimization plug-in that can accelerate generalization, inspired by swap Monte Carlo algorithm widely used in glass dynamics. Comparing SAM-Swap, weight decay, and Gaussian gradient noise, we find that accelerated generalization is consistently associated with random exploration in the parameter space, similar to diffusion in physics.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 3 Aug 2026.

Builds on

17 of 34 references.

References · 17

  1. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  2. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  3. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  4. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  5. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  6. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
  7. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  8. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
  9. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
  10. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 94
  11. 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 83
  12. 2024Deep Networks Always Grok and Here is Whycited by 51
5 more
  1. 2025Grokking at the Edge of Numerical Stabilitycited by 46
  2. 2016End-to-End Kernel Learning with Supervised Convolutional Kernel Networkscited by 28
  3. 2025Is Grokking a Computational Glass Relaxation?cited by 8
  4. 2025High-entropy Advantage in Neural Networks' Generalizabilitycited by 4
  5. 2024Bias of Stochastic Gradient Descent or the Architecture: Disentangling the Effects of Overparameterization of Neural Networkscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.