Dion: Distributed Orthonormalized Updates

Kwangjun Ahn, Byron Xu, Natalie Abreu, Ying Fan, Gagik Magakyan +3 more
4/7/2025
cs.LGcs.AImath.OC

Official code: microsoft/dion (496 stars, MIT, last commit 2026-04-29).

Abstract

Orthonormalized updates accelerate training, improve stability, and enable robust hyperparameter transfer, but existing methods like Muon rely on dense matrix operations that clash with sharded weights in large-scale LLM training, causing high compute and communication cost. We introduce Dion (Distributed Orthonormalization), a scalable and efficient update rule that replaces Newton-Schulz iteration with amortized power iteration on a momentum buffer, avoiding full-matrix reconstruction and integrating cleanly with weight sharding. The rank-fraction parameter with error feedback enables low-rank updates that balance quality with significant cost savings. On language models from 160M to 3B parameters, Dion retains the benefits of orthonormalized updates, while markedly reducing wall-clock time at scale, making it a practical optimizer for next-generation foundation models. Code is available at: https://github.com/microsoft/dion/

View on arXivView PDF

Code Implementations(1)

microsoft/dionOfficial100%
MIT

Dion optimizer algorithm

49658PythonMay 29, 20255 months agoMIT

Similar Papers

Cite this paper

@article{ahn2025dion,
  title  = {Dion: Distributed Orthonormalized Updates},
  author = {Kwangjun Ahn and Byron Xu and Natalie Abreu and Ying Fan and Gagik Magakyan and Pratyusha Sharma and Zheng Zhan and John Langford},
  year   = {2025},
  eprint = {2504.05295},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.05295v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.05295.svg)](https://codeofpaper.com/paper/2504.05295)

Discussion