Function-Space Learning Rates
Not on the map. Why?
Abstract (arXiv)
We consider layerwise function-space learning rates, which measure the magnitude of the change in a neural network's output function in response to an update to a parameter tensor. This contrasts with traditional learning rates, which describe the magnitude of changes in parameter space. We develop efficient methods to measure and set function-space learning rates in arbitrary neural networks, requiring only minimal computational overhead through a few additional backward passes that can be performed at the start of, or periodically during, training. We demonstrate two key applications: (1) analysing the dynamics of standard neural network optimisers in function space, rather than parameter space, and (2) introducing FLeRM (Function-space Learning Rate Matching), a novel approach to hyperparameter transfer across model scales. FLeRM records function-space learning rates while training a small, cheap base model, then automatically adjusts parameter-space layerwise learning rates when training larger models to maintain consistent function-space updates. FLeRM gives hyperparameter transfer across model width, depth, initialisation scale, and LoRA rank in various architectures including MLPs with residual connections and transformers with different layer normalisation schemes.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 29 of its 45 references that are in the map. First posted on arXiv 24 Feb 2025.
Builds on
29 of 45 references.
References · 29
- 2017Attention Is All You Needcited by 60,361
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016Layer Normalizationcited by 5,669
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 694
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
- 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 151
17 more
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 143
- 2023A Spectral Condition for Feature Learningcited by 109
- 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 106
- 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
- 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 97
- 2024The rising costs of training frontier AI modelscited by 95
- 2024Scalable Optimization in the Modular Normcited by 68
- 2023MathPile: A Billion-Token-Scale Pretraining Corpus for Mathcited by 67
- 2023Depthwise Hyperparameter Transfer in Residual Networks: Dynamics and Scaling Limitcited by 66
- 2020Tensor Programs III: Neural Matrix Lawscited by 49
- 2020On the distance between two neural networks and the stability of learningcited by 46
- 2023Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networkscited by 43
- 2024Infinite Limits of Multi-head Transformer Dynamicscited by 39
- 2024Super Consistency of Neural Network Landscapes and Learning Rate Transfercited by 23
- 2022Meta-Principled Family of Hyperparameter Scaling Strategiescited by 19
- 2023The Feature Speed Formula: a flexible approach to scale hyper-parameters of deep neural networkscited by 11
- 2024μP2: Effective Sharpness Aware Minimization Requires Layerwise Perturbation Scalingcited by 10
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.