← Back to feed
2026-06-25infracode

Hierarchical Muon: Tiled Newton-Schulz Updates for Efficient Muon Optimization

Ziyuan Tang, Tianshi Xu, Yousef Saad, Yuanzhe Xi

PDF preview for Hierarchical Muon: Tiled Newton-Schulz Updates for Efficient Muon Optimization
Read on arXiv →

Key claim

HiMuon improves optimizer efficiency while maintaining training performance.

In plain English

Imagine you're training a large neural network, and you want to make the process faster and more efficient. Traditional methods for updating the model's weights can be quite heavy, requiring a lot of computational resources and time. This is especially true when you're dealing with large matrices, where every update can become a bottleneck. The challenge is that as the size of the matrices grows, the complexity of the calculations increases, leading to longer training times and higher resource consumption. This is what's called computational inefficiency.

To tackle this, researchers have been looking for ways to optimize these updates without sacrificing the quality of the training. One common approach is to use methods that apply updates to the entire matrix at once, but this can lead to inefficiencies, especially with large models. The problem is that these full-matrix updates couple all the rows and columns, which can slow things down significantly. This is known as the full-matrix coupling issue.

The paper introduces a clever solution called Hierarchical Muon (HiMuon). Instead of applying updates to the entire matrix, HiMuon breaks the momentum-gradient matrices into smaller tiles. By applying the update independently to each tile, it reduces the computational load significantly. This means that instead of dealing with a massive matrix all at once, you can work with smaller, more manageable pieces. The result is a decrease in the amount of work needed for updates, allowing for faster training times while still keeping the training behavior close to what you would get with the full-matrix approach.

Practically, this means that if you're building systems that rely on large neural networks, using HiMuon could lead to more efficient training processes. You can expect to see improvements in how quickly your models learn without compromising their performance, making it a valuable tool for anyone working with complex neural architectures.

Novelty
7.5/10

HiMuon introduces a new tiled optimization approach that improves efficiency in neural network training.

Reliability
8.0/10

The experiments demonstrate improved optimizer-step efficiency with solid comparisons to existing methods.

Deep reliability assessment

The provided methodology supports the narrow claim that tiling Newton–Schulz updates can reduce optimizer-step work and preserve broadly similar training behavior in the tested transformer regimes. It does not support a general claim that local tiled spectral coupling is always a drop-in replacement for full-matrix Muon, especially across larger scales, different sharding layouts, or tasks where cross-tile spectral structure matters.

Reproducibility

Code: yes, the paper links a public implementation at https://github.com/tang0389/himuon. Datasets and exact benchmark configurations are not recoverable from the provided excerpt.

Key figure

The key architectural idea is a dense momentum-gradient matrix split into fixed-size T × T tiles, with the same finite Newton–Schulz map applied independently to each tile before reassembling the update matrix.

GitHub1 repo
tang0389/himuonOfficial