mlsanityData to 14 Oct 2026

Canonical Regularisation of Wide Feature-Learning Neural Networks

arXiv 2605.18180 ↗First posted 18 May 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Wide neural networks in the feature-learning regime drive modern deep learning, and yet they remain far less studied than their kernel-regime counterparts. We consider a critical yet under-explored difference between these two regimes: the regulariser and prior implied by gradient flow training. This canonical regularisation property is well-studied in kernel regime networks -- of all the infinite global minima, gradient flow selects exactly the vanishing ridge solution -- and underpins the celebrated NN-GP correspondence, precisely allowing the modelling of noise during training. However, we prove ridge regularisation biases gradient flow in feature-learning regime networks, even in the infinitesimal limit of vanishing regularisation. Over training, ridge distorts the inductive bias of the network, with a particular damage done to pretrained networks where the implicit prior is informative. We resolve this by axiomatising the canonical regulariser as a regime-agnostic function-space energy and lift, which uniquely identifies ridge in the kernel regime, and crucially generalises to the feature-learning regime. By studying the Riemannian geometry of feature-learning networks, we derive geodesic ridge from our framework, generalising ridge to the feature-learning regime. Correspondingly, we prove the canonical function-space prior is a Riemannian Gibbs Process, generalising the more familiar Gaussian Process. As a practical contribution, we propose arc ridge as a minimax-robust, scalable surrogate to geodesic ridge, revealing a deep relationship between early stopping and canonical regularisation across learning regimes. Finally, we demonstrate the consequences of our theory empirically on both image processing and NLP transfer-learning problems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 51 references that are in the map. First posted on arXiv 18 May 2026.

Builds on

33 of 51 references.

References · 33

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  5. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  6. 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
  7. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  8. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
  9. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
  10. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  11. 2019Benign Overfitting in Linear Regressioncited by 549
  12. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
21 more
  1. 2014New insights and perspectives on the natural gradient methodcited by 443
  2. 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 429
  3. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
  4. 2017Implicit Regularization in Matrix Factorizationcited by 322
  5. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 320
  6. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
  7. 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
  8. 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
  9. 2024Old Optimizer, New Norm: An Anthologycited by 193
  10. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  11. 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 151
  12. 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 143
  13. 2020Bayesian Deep Ensembles via the Neural Tangent Kernelcited by 90
  14. 2019Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networkscited by 76
  15. 2020Tensor Programs III: Neural Matrix Lawscited by 49
  16. 2019Gram-Gauss-Newton Method: Learning Overparameterized Neural Networks for Regression Problemscited by 40
  17. 2013Riemannian metrics for neural networks I: feedforward networkscited by 30
  18. 2020Understanding Approximate Fisher Information for Fast Convergence of Natural Gradient Descent in Wide Neural Networkscited by 22
  19. 2025Adaptive kernel predictors from feature-learning infinite limits of neural networkscited by 13
  20. 2026To Grok Grokking: Provable Grokking in Ridge Regressioncited by 8
  21. 2025A Gaussian Process View on Observation Noise and Initialization in Wide Neural Networkscited by 5

Built on by

Not cited yet.