Weight normalization: A simple reparameterization to accelerate training of deep neural networks
Summary
OpenAI presents weight normalization, a reparameterization technique that decouples weight vector length from direction to improve neural network training convergence and computational efficiency without introducing minibatch dependencies, making it suitable for RNNs and noise-sensitive applications.
View Cached Full Text
Cached at: 04/20/26, 02:45 PM
Similar Articles
Improving Neural Network Training by Decoupling the Magnitude and Direction of Weight Vectors | Alexander Hägele
This blog post introduces Magnitude-Direction (MD) Decoupling, a method that separates neural network weight matrices into direction and magnitude components optimized with separate learning rates. Experiments show improved performance across Adam and Muon optimizers, automatic learning rate transfer across model widths, and scaling benefits in large Mixture-of-Experts models.
Learning in Curved Weight Space:Exponential-Linear Weight Reparameterization for Improved Optimization
Introduces SymExpLin (SEL), a weight reparameterization that combines symmetric-exponential and linear pathways to improve optimization in neural networks, reducing training steps by up to 1.49x on transformers.
Predicting When Random Low-Dimensional Reparameterizations Train Neural Networks
This paper analyzes when random low-dimensional reparameterizations can train neural networks, deriving an orientation-resolved master formula for the random-slice residual and introducing RaMaN, a scalable framework that predicts required latent dimensions while dramatically reducing memory costs.
CoG-Guided Weight Correction for Fault-Tolerant Deep Neural Networks
Proposes a Center of Gravity guided weight correction method for fault-tolerant deep neural networks, achieving significant fault tolerance improvements on LSTM and CNN models without retraining.
Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations
This paper establishes a theoretical framework showing that smooth activations in deep neural networks can mitigate the curse of dimensionality in uniform convergence, providing non-asymptotic guarantees and outperforming ReLU networks in worst-case reliability.