activity
20182026
collaborators

15 papers

cs.LG2026

Dion3: Full-Stack Orthogonal Updates

Noah Amsel, Jack Zhang, Kwangjun Ahn +5

The Muon optimizer incurs a significant overhead cost due to its cubic-time Newton-Schulz orthogonalization step. When weights are sharded, communication overhead compounds this co…

math.NA2026

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop

Noah Amsel, Yves Baumann, Paul Beckman +33

This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the w…

cs.LG2025

Dion2: A Simple Method to Shrink Matrix in Muon

Kwangjun Ahn, Noah Amsel, John Langford

The Muon optimizer enjoys strong empirical performance and theoretical grounding. However, the super-linear cost of its orthonormalization step introduces increasing overhead with…

cs.LG2025

Customizing the Inductive Biases of Softmax Attention using Structured Matrices

Yilun Kuang, Noah Amsel, Sanae Lotfi +3

The core component of attention is the scoring function, which transforms the inputs into low-dimensional queries and keys and takes the dot product of each pair. While the low-dim…

cs.DS2025

Query Efficient Structured Matrix Learning

Noah Amsel, Pratyush Avi, Tyler Chen +5

We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix given access to matrix-vector product (matvec) queries of the…

math.NA2025

Quasi-optimal hierarchically semi-separable matrix approximation

Noah Amsel, Tyler Chen, Feyza Duman Keles +4

We present a randomized algorithm for producing a quasi-optimal hierarchically semi-separable (HSS) approximation to an matrix using only matrix-vector products wit…