arXiv Machine Learning

Muon Learns Facts Better: Understanding the Role of Spectral Orthogonalization

arXiv AI
Jul 16

Reassessing Muon for Matrix Factorization

arXiv:2607. 13246v1 Announce Type: cross Abstract: Muon has recently emerged as a strong optimizer for large-scale deep learning, where it reshapes gradient updates through approximate orthogonalization and has been reported to outperform Adam and AdamW in large language model training.

By Ali Parviz, Gal Mishne, Alex Cloninger
Hugging Face Trending Papers
Jul 14

Reassessing Muon for Matrix Factorization

Muon has recently emerged as a strong optimizer for large-scale deep learning, where it reshapes gradient updates through approximate orthogonalization and has been reported to outperform Adam and AdamW in large language model training. Its empirical success has motivated a growing body of theoretical work that interprets Muon as steepest descent under the spectral norm.

arXiv Machine Learning
Sep 7

Deep Learning as Neural Low-Degree Filtering: A Spectral Theory of Hierarchical Feature Learning

The paper introduces Neural Low-Degree Filtering (Neural LoFi), a stylized limit of gradient-based training that turns hierarchical feature learning into an explicit iterative spectral procedure. In this framework, each layer independently selects directions with maximal low-degree correlation to the label, providing a tractable surrogate for deep learning and a kernel-space interpretation. Experiments on fully connected and convolutional networks show that Neural LoFi outperforms lazy random-feature baselines, recovers meaningful structured filters, and aligns with early gradient-descent feature discovery on real datasets.

By Yatin Dandi, Matteo Vilucchio, Luca Arnaboldi, Hugo Tabanelli, Florent Krzakala
arXiv Machine Learning
5d ago

Mechanistic Evidence for Spectral Structures in Prior-Data Fitted Networks

The paper investigates whether Prior‑Data Fitted Networks (PFNs) encode spectral information about their input context. Across seven PFNs—including pretrained tabular foundation models and a decision‑tree prior model—a linear probe on the residual stream recovers the context’s frequency spectrum with high accuracy (R² ≥ 0.95), driven by a single principal direction. Activation and subspace patching show that the network exploits this spectral structure in a low‑dimensional subspace, and a Filter Bank Decoder can transform frozen PFN representations into an explicit stationary kernel that enables competitive Gaussian process regression at far lower cost.

By Kaustubh Sharma, Srijan Tiwari, Ojasva Nema, Parikshit Pareek