Scale-Invariant Neural Network Optimization: Norm Geometry and Heavy-Tailed Noise

A growing lesson from neural network optimization is that optimizer design should respect how the model is parametrized. The layerwise input-output structure of neural networks motivates scale-invariant optimizers, such as Muon and Scion, whose updates also support hyperparameter transfer. At the same time, stochastic gradient noise in deep learning is often far from sub-Gaussian and may exhibit heavy tails. These observations have shaped recent algorithmic principles for training neural networks, yet their joint theoretical consequences are underexplored. In particular, it remains unclear what dimension dependence is unavoidable for gradient-based methods given the problem class is defined by input-output norm and under heavy-tailed noise, and whether higher-order smoothness can accelerate training. We study these questions through nonconvex smooth stochastic optimization over mathbb Rm× n equipped with general norms and under pth-moment heavy-tailed noise, where the goal is to achieve an ε-stationary point in the dual norm. Our first contribution is a dimension-dependent lower bound: when fracmaxm,n(minm,n)2 is large enough, any gradient-based method requires Omega(minm, nε^-frac3p-2p-1) oracles for the problem class defined by the spectral norm, which is a common input-output norm. We prove that a scale-invariant Scion method with the spectral norm can achieve the matching upper bound of O(minm, nε^-frac3p-2p-1). To exploit higher-order smoothness, we propose a transported Scion method and improve the bound to O(minm, nε^-frac5p-32p-2) when the Hessian is Lipschitz. Finally, we incorporate heuristics into our transported method and evaluate it across multiple architectures and model sizes, demonstrating its flexibility and compatibility with neural network training.