Sharp Heterogeneity Barriers for Adam: Basis-Aware Convergence and High-Dimensional Divergence
Abstract
Convergence proofs for Adam on finite sums often assume strong growth, . The constant is at least , with equality exactly when all component gradients agree, yet the known cyclic counterexamples have . We ask how much heterogeneity Adam tolerates at fixed memory , and the answer depends on the dimension and on the coordinate system. In one dimension the threshold is : a sharp inequality for Adam's averaged normalized update gives convergence below it, for strongly convex averages with Lipschitz component gradients, and divergent instances exist at . In higher dimensions, positive-definite quadratics with a common minimizer can make Adam diverge with arbitrarily close to one, under cyclic order, IID minibatches and random reshuffling; in the random cases the probability of divergence tends to one for distant starting points. An outward divergent ray needs at condition number , and this is exact under cyclic order. Bounded conditioning gives a dimension-independent convergence region, which is nonempty exactly when ; for this limit is sharp, because at every larger trajectories that keep turning can diverge as . The threshold returns under coordinatewise growth, for separable averages and with a single shared second moment, also under arbitrary epoch orders and IID sampling, with non-asymptotic bounds for cyclic order. Since a quadratic average is separable in its eigenbasis, a change of basis alone can turn divergence into convergence. All results allow denominator regularization and bias correction, and interval arithmetic certifies cyclic and IID divergence at the default . In a small Transformer, function-preserving rotations consistently increase test loss, and spectral bounds on Adam's frozen updates separate two bases with identical aggregate growth.
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.