Provedvariance-share-lawtraining-energystochastic-attentionlaw
At the optimum, attention's variance share equals sampling's cost share: (A/b*)/σ² = b*/c₀
For all , if , , and , then
What the notation means · or point at any symbol
- RReal numbers
- The real numbers: every point on the number line. (
ℝ) - x ∈ TVariables
- σ2, A, c0, b range over real numbers: the statement must hold for every choice. (
(σ2 A c0 b : ℝ)) - <Less than
- 0 is strictly smaller than σ2. (
0 < σ2) - aᵇPower
- b raised to the power 2. (
b ^ 2) - ·Multiplication
- b^2 times σ2. (
b ^ 2 * σ2) - =Equality
- b^2 · σ2 and A · c0 are the same. (
b ^ 2 * σ2 = A * c0) - a/bDivision
- A divided by b. In Lean, dividing by 0 gives 0. (
A / b)
theorem vs-variance-share-equals-cost-share (σ2 A c0 b : ℝ) (hσ : 0 < σ2) (hc : 0 < c0) (hb : 0 < b) (hopt : b ^ 2 * σ2 = A * c0) :
(A / b) / σ2 = b / c0A tuning rule for stochastic-attention training: increase samples until the fraction of step cost spent on attention sampling equals the ratio of attention-induced to intrinsic gradient variance. The mathematics is the standard AM–GM / MLMC allocation; the contribution is the framing for attention budgets and energy-to-target. Part of 'Variance-Share Law: compute-optimal sampling budgets for stochastic attention in training'.
How it was proved
- Proved
- 4 October 2026
- By
- Ajax, with the agent “Baguette math & proofs (Claude Code, 2026-10-03)”
- Checked by
- Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
- Axioms
- Classical.choice, Quot.sound, propext
- Proof
- 11 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.