A thorough reproduction and evaluation of µP

This paper is an independent empirical reproduction of the claimed benefits of the µP parametrization proposed in Yang & Hu (2020) and Yang et al. (2021). Under the so-called Standard Parametrization (SP), the weights of neural networks are initialized from the Gaussian distribution with variance scaling as the inverse of “fan-in”, with the learning rate being the same for every layer. While this guarantees that (pre)activations are $\mathcal{O}$(1) at initialization with respect to width, it causes their scale to be width-dependent during training. To address this, Yang & Hu (2020) and Yang et al. (2021) proposed the Maximal Update Parametrization (µP), which is also claimed to make the optimal value of various hyperparameters independent of width. However, despite its alleged benefits, µP has not gained much traction among practitioners. Possibly, this could stem from a lack of thorough independent evaluation of µP against SP. We address this by independently reproducing the empirical claims of the original works. At the same time, we substantially increase the scale of the experiments, by training 16000 neural networks of sizes from 500 to 1B parameters, and empirically investigate µP’s effect on outputs, gradient updates, weights, training loss and validation loss. We find that generally µP indeed delivers on its promises, even though this does not always translate to improved generalization.

Publication Details

Journal
Repository for Publications and Research Data (ETH Zurich)
Published
2025-01-01
DOI
https://doi.org/10.3929/ethz-b-000726357
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A thorough reproduction and evaluation of µP

Repository for Publications and Research Data (ETH Zurich)
Machine Learning and Data Classification
article

A thorough reproduction and evaluation of µP

article en

Abstract

This paper is an independent empirical reproduction of the claimed benefits of the µP parametrization proposed in Yang & Hu (2020) and Yang et al. (2021). Under the so-called Standard Parametrization (SP), the weights of neural networks are initialized from the Gaussian distribution with variance scaling as the inverse of “fan-in”, with the learning rate being the same for every layer. While this guarantees that (pre)activations are $\mathcal{O}$(1) at initialization with respect to width, it causes their scale to be width-dependent during training. To address this, Yang & Hu (2020) and Yang et al. (2021) proposed the Maximal Update Parametrization (µP), which is also claimed to make the optimal value of various hyperparameters independent of width. However, despite its alleged benefits, µP has not gained much traction among practitioners. Possibly, this could stem from a lack of thorough independent evaluation of µP against SP. We address this by independently reproducing the empirical claims of the original works. At the same time, we substantially increase the scale of the experiments, by training 16000 neural networks of sizes from 500 to 1B parameters, and empirically investigate µP’s effect on outputs, gradient updates, weights, training loss and validation loss. We find that generally µP indeed delivers on its promises, even though this does not always translate to improved generalization.

Repository for Publications and Research Data (ETH Zurich)
Openalex Percentile: Top 74%
Machine Learning and Data Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.