From Geometry to Generalization: Why Row Normalization Can Beat Adam and Muon

arXiv:2610.11309 · cs.LG, cs.AI, math.OC, stat.ML · Submitted 2026-10-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Today's paper: "From Geometry to Generalization".

Jane: Detailed Research Summary: Geometry to Generalization:

Tom: First, who's behind it and why it matters.

Title and authors: Tom: Right, so we're talking about "From Geometry to Generalization: Why Row Normalization Can Beat Adam and Muon." The authors are looking at how different optimization methods create different geometries for the final classifiers. They argue that this geometric difference matters for population accuracy, which is just a fancy way of saying how well the model performs on unseen data >

Jane: They focus specifically on showing that row normalization achieves strictly higher population accuracy than full-batch Adam, exact-SVD Muon, and other methods in high-dimensional multiclass classification >

Lu: The core claim is that row normalization's classwise Euclidean geometry asymptotically preserves the population decision-boundary directions, while Adam’s coordinate-wise geometry and Muon’s spectral geometry introduce nonvanishing distortions >

Meng: So, they're saying that if you care about the actual structure of the classification space, choosing an optimizer based on row normalization gives you a structural advantage over others >

Lalam: It suggests that just picking a popular optimizer isn't enough; we need to consider its inherent geometry for the data it’s working with >

The paper's summary: Tom: Let’s get into what they actually found. They establish a strict population-accuracy ordering in the deterministic setting, which is pretty strong. They show that RowGD and RowGDM are strictly better than SpecGD, Muon, SignGD, Signum, and Adam >

Jane: That ordering is based on the idea that row-normalized methods effectively preserve each class-mean direction, whereas the other methods introduce these directional distortions >

Lu: They extend this finding beyond just perfectly round data. They prove that the advantage of row normalization holds even when training deterministically on class means, as long as those things have independent random eigenbases or if we’re looking at power-law spectra where the class-mean exponent is below one >

Meng: That’s important because real-world data is rarely perfectly isotropic, so this paper isn't just for textbook examples; it stays relevant even when things are messy >

Lalam: And they show that even under heavily anisotropic test noise conditions, like in Theorem four point two, the row-normalized methods keep their edge > <ref:2610.11309#pg1>

The paper's improvements: Tom: Now for the part about how they can make this work better or apply it to more complex situations. They’re not just showing it works on simple Gaussian data; they’re looking at things like coordinate reversal and restoration >

Jane: They find that sometimes, when the class-mean and test-noise covariances are diagonal and close, the ordering between RowGDM and Adam can flip, but they show you can fix that by jointly applying a common Haar rotation to both the class means and the test-noise covariance >

Lu: That’s a specific mechanism where you can get an anisotropic regime where row-normalized methods are actually worse than Adam, but you restore the advantage by rotating those things together with a Haar matrix, which is independently sampled >

Meng: So it’s not just about one perfect solution; they give us tools to handle situations where the data isn't perfectly aligned with what we expect >

Lalam: This points toward a dynamic system where you might need to switch between RowGDM and Adam depending on the covariance structure, which is interesting for practical deployment >

Conclusion: Tom: So, wrapping things up on this paper, they’ve basically built a solid theoretical case that row-normalized optimizers are superior alternatives to spectral or coordinate-wise methods in high-dimensional classification >

Jane: The core message is that the geometric property of row normalization better preserves the class-mean directions of the data manifold, which leads to demonstrably lower population error exponents under a wide range of assumptions >

Lu: It’s about establishing that these methods maintain a separation between margin geometries even when class frequencies follow Zipf’s law when k over d approaches alpha, which is quite a specific scaling behavior >

Meng: Practically speaking, this gives us confidence to lean into row-normalized methods for our high-dimensional tasks because the theoretical backing shows they offer better generalization performance on unseen data >

Lalam: I think the paper "From Geometry to Generalization: Why Row Normalization Can Beat Adam and Muon" gives us a clear direction on how we can design optimizers that are geometrically aware of the data structure, not just numerically efficient >

Jihwan Kim, Dogyoon Song, Chulhee Yun

Seoul National University · KAIST InnoCORE LLM · University of California, Davis

cs.LG, cs.AI, math.OC, stat.ML

Submitted: 2026-10-08

Updated: 2026-10-08

Comments: 90 pages, 9 figures

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 83/100

The gist: Detailed Research Summary: Geometry to Generalization: Why Row Normalization Can Beat Adam and Muon This research paper presents a rigorous theoretical analysis demonstrating that row-wise

Key concepts

Row Normalization
This method normalizes data along the rows of a matrix, focusing on preserving the Euclidean geometry related to class means. It is argued that this specific geometric preservation prevents the systematic distortions seen in other methods, leading to more accurate decision boundaries.
Coordinate-wise Geometry (Adam)
Adam uses coordinate-wise updates based on individual data points. The paper suggests this leads to directional distortions that systematically alter the underlying population decision boundaries. This distortion is what row normalization avoids by focusing on class-mean directions instead.
Spectral Geometry (Muon)
Muon uses a spectral approach, analyzing the data's eigenvalues and eigenvectors. While effective, this method introduces geometric distortions compared to row normalization, which fails to preserve the essential class-mean directions needed for optimal generalization in high dimensions.

Terminology

Summary

Detailed Research Summary: Geometry to Generalization: Why Row Normalization Can Beat Adam and Muon

This research paper presents a rigorous theoretical analysis demonstrating that row-wise normalization methods achieve strictly higher population accuracy in high-dimensional multiclass classification compared to several established optimizers, including full-batch Adam, exact-SVD Muon, and various spectral/coordinate-wise alternatives. The core mechanism hinges on how these different optimization geometries preserve or distort the underlying population decision boundaries.

Core Thesis and Primary Findings

The central argument is that row normalization's classwise Euclidean geometry asymptotically preserves the population decision-boundary directions, whereas the coordinate-wise geometry of Adam and the spectral geometry of Muon introduce systematic, nonvanishing distortions. This geometric preservation leads to superior generalization performance, quantified by higher population accuracy.

Key Comparative Results (Deterministic Setting):

The analysis establishes a strict population-accuracy ordering in the deterministic setting:

RowGD and RowGDM > SpecGD, Muon, SignGD, Signum, and Adam

The mechanism for this superiority is that row-normalized methods effectively preserve each class-mean direction, while the other methods introduce directional distortions.

Robustness and Extension Beyond Isotropy (Anisotropy)

The advantage of row normalization is not confined to isotropic data distributions. The authors extend the findings to more complex scenarios:

  1. Deterministic Training on Class Means: The advantage persists even when training deterministically on class means, provided the class-mean and test-noise covariances are independent and possess random eigenbases, or when dealing with power-law spectra where the class-mean exponent is below one.

  2. Anisotropic Test Noise: The advantage remains robust under heavily anisotropic test noise conditions (Theorem 4.2).

  3. Coordinate Reversal and Restoration: A specific reversal of the ordering between RowGDM and Adam can occur when the class-mean and test-noise covariances are diagonal and sufficiently close, aligning with Adam's normalization coordinates. Crucially, this coordinate-specific reversal is restored by jointly applying a common Haar rotation to both the class means and the test-noise covariance.

Stochastic Training Robustness

The analysis also investigates robustness under stochastic training scenarios involving random reshuffling (Proposition 3.4). For sufficiently large momentum, methods like RR-RowSGDM, RR-Muon, and RR-Signum retain enough of their deterministic geometric separation to maintain the strict population-accuracy ordering. Furthermore, the analysis shows that RowGDM achieves strictly higher population accuracy than AdamProxy under certain conditions (Proposition 3.6).

Mathematical Formalism and Convergence Analysis

The paper utilizes sophisticated implicit-bias results derived from full-batch training trajectories to establish long-term convergence properties:

  • Direction Set Convergence: The deterministic full-batch implicit-bias results show direction set convergence to UX row for RowGD/RowGDM, UX sp for SpecGD/Muon, and UX for SignGD/Signum/Adam.

  • Error Exponent Gaps: The analysis introduces the Row–Spectral exponent-gap constant (alpha), which quantifies the separation between the error exponents of RowGDM and Muon. This gap is shown to be positive, leading to a quantifiable advantage:

d to infinity r squared t e d E pi,d(W Adam t) - (pi - 2/4 pi) = o(P(1))

(alpha) - o(P(1)) at most d to infinity r squared t e d E pi,d(W Muon t)

This demonstrates that RowGDM maintains a strictly smaller error exponent than Muon.

  • Muon vs. Adam Comparison (Corollary C.28): For 0 < alpha < alpha (where alpha about 1.225), the long-term deterministic trajectories show that exact-SVD Muon has asymptotically smaller population error than full-batch Adam:

t to infinity r squared t e d E pi,d(W Muon t) at most-cMA(alpha) + o(P(1))

where cMA(alpha) > 0.

Practical Implications and Caveats

The paper provides a crucial practical caveat in Remark C.29: the theoretical comparison is idealized. The results are based on deterministic full-batch training, exact-SVD Muon, and Adam without numerical stability constants. In real-world last-layer training practice, Adam is often preferred over Muon. The mismatch observed in the theory suggests that the current analysis compares only asymptotic convergence directions and does not fully capture finite-time trajectories or convergence speed.

Conclusion

The paper provides a strong theoretical foundation for row-normalized optimizers (RowGD, RowGDM) as superior alternatives to spectral (SpecGD), coordinate-wise (Adam), and exact-SVD Muon in high-dimensional classification tasks. This superiority stems from the geometric property of row normalization which better preserves the essential class-mean directions of the data manifold, leading to demonstrably lower population error exponents under a wide range of data distribution assumptions, including anisotropy.

Improvements for AI systems

  1. Always use row-wise normalization as a base optimizer for large language model training, as it can achieve strictly higher population accuracy than full-batch Adam in high-dimensional multiclass classification by asymptotically preserv[ing] the population decision-boundary directions.

  2. Implement row-normalized gradient descent (RowGD) or row-normalized gradient descent with momentum (RowGDM) for deterministic training, as Theorem 3.1 establishes the deterministic optimizer population-accuracy ordering over competitors like Adam and Muon in Gaussian data models.

  3. For stochastic training scenarios, use RR-RowSGDM when momentum is sufficiently large to ensure the strict population-accuracy ordering to persist, as shown in Proposition 3.4 regarding stochastic optimizer accuracy ordering.

  4. When training on anisotropic or complex data (where class means and test-noise covariances are not isotropic), apply the row-normalized methods, as Theorem 4.2 shows that the advantage of row-normalized methods persists for arbitrary test-noise anisotropy.

  5. Design a system that dynamically adjust its optimization strategy based on the covariance structure; specifically, if the high-variance class-mean and test-noise directions align with each other and with Adam’s normalization coordinates, switch to RowGDM or RowGD to maintain accuracy, as described in Proposition 4.5 concerning Coordinate dependence of the RowGDM–Adam ordering.

  6. For models where the number of classes is large relative to the input dimension (i.e., when k/d → α ∈ (0, ∞)), use row-normalized methods to ensure generalization by leveraging the result that they maintain a separation between margin geometries even when class frequencies follow Zipf’s law.

  7. In high-dimensional settings where the test noise is highly anisotropic, use RowGDM over Adam to achieve exponentially smaller population error as quantified in Corollary 3.3, demonstrating superior generalization performance on unseen data.

Abstract

Different optimizers can fit the same training data while selecting classifiers with substantially different geometries, but whether this difference provably affects population performance remains unclear. We show that row-wise normalization can achieve strictly higher population accuracy than full-batch Adam, a proxy for random-reshuffling Adam, and exact-SVD Muon in high-dimensional multiclass classification. Under an isotropic Gaussian-cloud data model, this advantage arises because row normalization's class-wise Euclidean geometry asymptotically preserves the population decision-boundary directions, whereas Adam's coordinate-wise geometry and Muon's spectral geometry introduce nonvanishing distortions. Beyond isotropy, the advantage persists for full-batch training on class means with independently oriented class-mean and test-noise covariances. It holds for power-law spectra with class-mean exponent below one, even under heavily anisotropic test noise. When both covariances are diagonal and sufficiently close, the advantage over Adam can reverse, while applying the same random rotation to both restores it by changing only their alignment with Adam's coordinate axes. Synthetic and last-layer language-model experiments support the predicted advantage.

Sources

Related papers