PulseAugur
EN
LIVE 06:26:10

DeMuon algorithm enables decentralized matrix optimization over graphs

Researchers have introduced DeMuon, a novel decentralized method for matrix optimization over graphs. This approach extends the centralized Muon algorithm by incorporating matrix orthogonalization through Newton-Schulz iterations and utilizing gradient tracking to handle local function heterogeneity. DeMuon achieves iteration complexity comparable to centralized algorithms, even under heavy-tailed noise, and is presented as the first direct extension of Muon to decentralized graph optimization with theoretical guarantees. Preliminary experiments show DeMuon outperforming other decentralized algorithms in transformer pretraining tasks across various network topologies. AI

IMPACT Introduces a new decentralized optimization method that could improve distributed AI training efficiency.

RANK_REASON The cluster contains a research paper detailing a new algorithm with theoretical guarantees and preliminary experimental results. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · Chuan He, Shuyi Ren, Jingwei Mao, Erik G. Larsson ·

    DeMuon: A Decentralized Muon for Matrix Optimization over Graphs

    arXiv:2510.01377v2 Announce Type: replace-cross Abstract: In this paper, we propose DeMuon, a method for decentralized matrix optimization over a given communication topology. DeMuon incorporates matrix orthogonalization via Newton-Schulz iterations-a technique inherited from its…