infrastructure
fact
bullish
The sample complexity bounds for Muon match the best-known guarantees for nonsmooth nonconvex optimization and are optimal for smooth nonconvex optimization up to problem-dependent factors
The resulting sample complexity bounds match the best-known guarantees for nonsmooth nonconvex optimization and are optimal for smooth nonconvex optimization up to problem-dependent factors.
Machine Learning (Statistics)29 Aug 2026