Skip to content

When the Preconditioning Exponent Turns Negative: Learning-Rate Coupling and Cross-Environment Generalization

Jul 2026 · 0 citations · 18 references
Computer Science

TL;DR

Checkpoint decomposition shows that lower p reduces the learned spurious-to-stable and noise-to-stable and noise-to-stable weight ratios; under reversed correlation, it also reduces the magnitude of the harmful spurious margin.

Abstract

Adaptive optimizers are commonly parameterized by a fixed power of the second-moment estimate. Existing partially adaptive methods study exponents between momentum-like updates and the standard Adam square root, while the interaction between this exponent and the global learning rate is less understood. We perform a controlled cross-environment study using a paired four-environment classification problem with stable sparse features, environment-dependent spurious sparse features, dense features, and high-dimensional noise. Across \NumRuns{} source-training runs covering 21 preconditioning exponents $p\in[-0.5,0.5]$ and five learning rates $\eta\in[10^{-4},10^{-2}]$, we find that the exponent maximizing cross-environment accuracy decreases almost linearly with $\log_{10}\eta$. The fitted slopes range from $-0.270$ to $-0.300$, with $R^2$ between $0.972$ and $0.996$. At $\eta=10^{-2}$, source-validation selection still prefers positive exponents in all four environments, whereas cross-environment and worst-environment criteria prefer negative exponents. Checkpoint decomposition shows that lower $p$ reduces the learned spurious-to-stable and noise-to-stable weight ratios; under reversed correlation, it also reduces the magnitude of the harmful spurious margin. Negative $p$ is therefore not a universally optimal setting. It is a high-step-size allocation regime produced by the joint action of learning rate and preconditioning. The study also exposes a model-selection conflict: source-domain validation systematically selects a different preconditioning regime from the one that maximizes robustness to environmental change. The results are a single-seed, finite-budget mechanism study rather than a broad benchmark claim.

View source

Similar papers

#machine learning Preprint Sep 2026

Optimizer-dependent training dynamics converge to the same one-third optimal data scaling

Neural scaling, in which loss falls as a power law with training, is central to large language models, and one recent proposal is that a $1/3$ exponent emerges from learning peaked distributions. That account describes SGD, but models in practice are trained with adaptive optimizers. Here we separate two exponents the...

Hyunseok Lee, M. Basil, Yizhou Liu et al. · 0 citations
#machine learning Preprint Oct 2026

A Solvable Model of Adaptive Learning Rate Rescaling: Acceleration, Stability&Scaling

A recurring design principle in modern optimizers is to decouple update magnitude from the raw gradient norm, yet its consequences for learning-curve and resource scaling remain unclear. We isolate this mechanism by studying normalized SGD in a random-feature model with power-law teacher and data covariance. Fixed-norm...

Itay Lavie, Clarissa Lauditi, Cengiz Pehlevan · 0 citations
#machine learning Preprint Oct 2026

Asymptotic Risk of Learning-Rate Schedules for Least-Squares Regression with Discretely Distributed Features

We study the last iterate of stochastic gradient descent (SGD) on streaming least squares with discretely distributed features (Slock's model), which decouples the dynamics across eigendirections. Under power-law source and capacity conditions, we derive the exact finite-time risk and asymptotic equivalents of constant...

Noé Colomban, Francis R. Bach, Fabian Schaipp · 0 citations
#machine learning Preprint Aug 2026

Linear RNN Scaling Laws: When Longer Sequences Beat More Sequences

A tractable teacher--student model where a stable latent linear RNN generates trajectories and a sketched linear recurrent student is trained by safeguarded full-batch WSD gradient descent on next-token prediction is studied.

Zi-Yan Chen, Zhong-Zhu Zhou, Pei-Lin Liu et al. · 0 citations
#machine learning Preprint Sep 2026

On the Two Faces of Adam in Separable Linear Classification

This work gives sufficient conditions under which an Adam-trained classifier nearly maximizes the max-norm margin before the updates become gradient-like, and shows that for polynomially decreasing stepsizes with exponent \(a), the updates become approximately proportional to the negative gradient after $\Theta(1/\epsi...

Fan Chen, Csaba Szepesvari · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.