Source

Qi, He, Ye, Li, Zi, Dai, Zou and Xiao (2025), LIT-521 — read as NOTE-266. ICLR 2025.

Do this

The rule is LIT-521’s: it argues that a run crashes when the spectral energy of W_q^T W_k concentrates into a few directions (fewer than 10 in its crashed runs), derives this cap from Weyl’s inequality to stop that, and calls the result AdamW².

At each step, after computing the update ∇W_t that the optimizer would apply:

if α_t > τ · σ₁(W_{t−1}) / σ₁(∇W_t):
    α_t ← τ · σ₁(W_{t−1}) / σ₁(∇W_t)

Take both spectral norms from power iteration capped at 3 iterations; the source reports 2 as sufficient. Then run a plain cosine decay from the maximum learning rate, with no warmup at all.

Why this is the right quantity. Weyl’s inequality gives σ₁(W_{t−1} + ∇W_t) ≤ σ₁(W_{t−1}) + σ₁(∇W_t), so the ratio is exactly the handle on how much a single step can inflate the largest singular value. τ is the budget: the step may grow σ₁ by at most a τ fraction of what it already is.

What it buys

ViT-B 86MViT-L 307MGPT-S 125MSwin-S 50MSwin-B 88M
AdamW, with warmup80.2281.652.84883.0283.48
this, no warmup80.5881.822.84083.1483.44

The warmups removed are 60 epochs for ViT, 20 for Swin and 2000 steps for GPT-S. Four of five configurations improve slightly; Swin-B is 0.04 worse. Without the cap, the same models trained without warmup crash.

Why Proposed

It contradicts two Active practices in this record and the scales do not meet. SOTA-008 and SOTA-100 both say to use warmup, the second proportionally to model size. This says a spectral cap makes it unnecessary — demonstrated at 50M to 307M, which is below where those practices were established and far below where warmup is expensive to get wrong. Neither side has tested the other’s regime.

One group, no comparison against the alternatives. The baseline is AdamW with warmup. The three other remedies for the same underlying failure — SOTA-192, SOTA-131, SOTA-319 — do not appear, so “this works” is established and “this is what to reach for” is not.

τ replaces the hyperparameter it removes. The paper ablates four values per architecture and the curves are not flat. Trading a warmup length for a threshold is a real trade, not a free removal, and the source does not claim otherwise.

Conditions

Two power iterations per matrix per step is not free, though it is on parameters rather than activations. The source does not report the wall-clock overhead separately.

It caps the step, so it interacts with the schedule. The rule overrides the scheduled learning rate whenever the ratio test fires, which is mostly early. Read it as an automatic warmup derived from the weights rather than as no warmup at all — the paper’s framing is “without warmup” and the mechanism is closer to “warmup computed rather than guessed”.

Demonstrated on ViT, Swin and GPT-2-small. Nothing on a modern decoder-only model at scale, and nothing with a different optimizer.

The account it comes with is one group’s correction of another’s. THEORY-062 holds that spectral energy concentration, not low entropy, is what crashes a run. If that is wrong the practice may still work, since capping σ₁ growth suppresses both candidate failure modes.

Known implementations

None beyond the authors’ own runs.