English

A Proof of Learning Rate Transfer under $\mu$P

Machine Learning 2026-02-26 v3 Artificial Intelligence Computation and Language Machine Learning

Abstract

We provide the first proof of learning rate transfer with width in a linear multi-layer perceptron (MLP) parametrized with μ\muP, a neural network parameterization designed to ``maximize'' feature learning in the infinite-width limit. We show that under μP\mu P, the optimal learning rate converges to a \emph{non-zero constant} as width goes to infinity, providing a theoretical explanation to learning rate transfer. In contrast, we show that this property fails to hold under alternative parametrizations such as Standard Parametrization (SP) and Neural Tangent Parametrization (NTP). We provide intuitive proofs and support the theoretical findings with extensive empirical results.

Keywords

Cite

@article{arxiv.2511.01734,
  title  = {A Proof of Learning Rate Transfer under $\mu$P},
  author = {Soufiane Hayou},
  journal= {arXiv preprint arXiv:2511.01734},
  year   = {2026}
}

Comments

21 pages