Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

AMSGrad has an online convex regret bound under decaying first-moment weights

Statement

Let d,T∈N with d,T≥1. Let F⊆Rd be nonempty, compact, and convex, choose x1∈F, and suppose a finite D∞≥0 satisfies ∣xi−ui∣≤D∞ for every x,u∈F and coordinate i. Let ℓ1,…,ℓT:F→R be continuous convex losses, choose gt∈∂ℓt(xt), and assume ∣gt,i∣≤G∞ for all t,i, where G∞≥0. Run uncorrected AMSGrad with αt=α/t for α>0, fixed β2∈(0,1), β1=β1,1∈[0,1), 0≤β1,t≤β1, and γ=β1/β2<1. For a comparator u∈F, define RT(u)=∑t=1T(ℓt(xt)−ℓt(u)); the best-comparator regret is RT=sup⁡u∈FRT(u). Then RT(u)≤D∞2T2α(1−β1)∑i=1dv^T,i+D∞2(1−β1)2∑t=1T∑i=1dβ1,tv^t,iαt+α(1−β1)2(1−γ)1−β2∑i=1d∑t=1T∣gt,i∣t. If, in addition, β1,t=β1λt−1 for a fixed λ∈[0,1) or β1,t=β1/t, then with the other displayed parameters fixed, the best-comparator regret satisfies RT=O(T).

Statement references

Uncorrected AMSGrad with a coordinatewise historical maximum: defines the uncorrected raw-moment update and coordinatewise historical maximum used here.

Convex and strictly convex functions on Euclidean convex sets: convexity supplies the subgradient regret inequality.

Subgradients and the subdifferential of a convex function: gt∈∂ℓt(xt) means ℓt(u)≥ℓt(xt)+⟨gt,u−xt⟩.

One-step regret inequality for AMSGrad: gives the per-round projection and momentum inequality.

AMSGrad momentum energy is bounded by a coordinatewise weighted gradient sum: bounds the accumulated preconditioned momentum term.

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: continuous losses on the nonempty compact set have bounded sums, so the best-comparator regret is finite.

Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined: finite sums of continuous real-valued losses are continuous.

Reddi, Kale, and Kumar, Theorem 4 and Appendix D

Hazan, Introduction to Online Convex Optimization, §5.6.1

Facts & Assumptions

Given: The finite horizon, compact convex domain, losses, subgradients, coordinate bounds, AMSGrad update, and parameters in the Statement.

[F1]

Uncorrected AMSGrad with a coordinatewise historical maximum: vt,i=β2vt−1,i+(1−β2)gt,i2, v^t,i=max⁡{v^t−1,i,vt,i}, qt,i:=v^t,i is nondecreasing in t, and the weighted projection uses ∑iqt,i(xi−yt+1,i)2.

[F2]

RMSProp, Adam, and AMSGrad moment updates are well-defined: all moment coordinates are finite and all second-moment coordinates are nonnegative; zero historical-maximum coordinates have zero first moments.

[F3]

One-step regret inequality for AMSGrad: for each comparator u, the one-step loss difference is bounded by a potential difference, two momentum-energy terms, and a first-moment correction term.

[F4]

AMSGrad momentum energy is bounded by a coordinatewise weighted gradient sum: ∑tαtEt(mt)≤α(1−β1)(1−γ)1−β2∑i,t∣gt,i∣/t.

[F5]

Subgradients and the subdifferential of a convex function: ℓt(xt)−ℓt(u)≤⟨gt,xt−u⟩.

[F6]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and Laws of finite sums and finite products: weighted squared distances and sums over coordinates expand termwise and telescope.

[F7]

Squaring is monotone on the nonnegatives and Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}: v^t,i≥v^t−1,i≥0 implies qt,i≥qt−1,i.

[F8]

Ordered field, Sign rules for products and monotonicity of multiplication, and Inverses of positives are positive, and reciprocation reverses order: positive denominators preserve inequalities, and 1−β1>0, 1−γ>0, and 1−β2>0.

[F10]

The natural numbers N (von Neumann), Integer powers am, Finite sums and finite products, by recursion, and Laws of finite sums and finite products: integer powers obey rn+1=rnr, and finite sums may be telescoped and reindexed.

[F11]

The principle of mathematical induction: induction propagates a base bound through every finite moment update.

Proof

Given: All data and hypotheses in the Statement. Fix an arbitrary comparator u∈F.

1.1F3F5F6givenalgebra

By [F5] and the one-step inequality [F3], sum over t=1,…,T. With qt,i=v^t,i, Φt=∑iqt,i(xt,i−ui)2, and Ψt=∑iqt,i(xt+1,i−ui)2, the resulting bound is RT(u)≤∑t=1T[Φt−Ψt2αt(1−β1,t)+αtEt(mt)2(1−β1,t)+β1,tαtEt(mt−1)2(1−β1,t)+β1,tΦt2αt(1−β1,t)].

1.2F1F2F7F8F11giveninductionalgebra

The moment recurrence and ∣gt,i∣≤G∞ give 0≤vt,i≤G∞2 by induction; since v^t,i is the maximum of the raw second moments through round t, qt,i≤G∞. Also ∑t=1T∣gt,i∣t≤G∞∑t=1T1t≤2G∞T, because 1/t≤2(t−t−1) for t≥1. Thus the first and third terms in the bound are O(T).

2.1F1F2F8step 1.1givenalgebra

Since qt,i is nondecreasing and αt is nonincreasing, Et(mt−1)≤Et−1(mt−1) and αt≤αt−1 for t≥2; the t=1 previous-moment term is zero. Also β1,t/(1−β1,t)≤β1/(1−β1). Thus the two energy sums in step 1.1 are at most (12(1−β1)+β12(1−β1))∑t=1TαtEt(mt)≤11−β1∑t=1TαtEt(mt).

2.2F1F6F7F8step 1.1givenalgebra

In the potential sum of step 1.1, drop the final nonpositive term −ΨT/(2αT(1−β1,T)), since ΨT≥0. Fix coordinate i and put rt,i=qt,i/αt, with r0,i=0. The unpaired first positive potential is at most D∞2r1,i/(2(1−β1)). For each t≥2, pair the positive potential at round t with the negative potential from round t−1. Its coefficient difference is qt,iαt(1−β1,t)−qt−1,iαt−1(1−β1,t−1)=rt,i−rt−1,i1−β1,t−1+rt,i(11−β1,t−11−β1,t−1). The first difference rt,i−rt−1,i is nonnegative by [F1], [F7], and αt=α/t. The reciprocal difference is nonpositive when β1,t≤β1,t−1; otherwise it equals (β1,t−β1,t−1)/((1−β1,t)(1−β1,t−1))≤β1,t/(1−β1)2. Thus the sum of all first coefficient differences, including the first-round term, is at most D∞2rT,i/(2(1−β1)), because r1,i+∑t=2T(rt,i−rt−1,i)=rT,i. Summing coordinates gives D∞22αT(1−β1)∑iqT,i. The coefficient correction and the explicit last term of step 1.1 together contribute at most D∞22(1−β1)2∑t,iβ1,tqt,iαt+D∞22(1−β1)∑t,iβ1,tqt,iαt≤D∞2(1−β1)2∑t,iβ1,tqt,iαt, because 2−β1≤2.

3.1F4step 2.1step 2.2givenalgebra

Apply [F4] to the energy bound in step 2.1 and combine with step 2.2. Since 1/αT=T/α, this gives the displayed regret inequality.

4.1F4F6F8F9F10F12step 1.2givenalgebra∎

The cumulative loss u↦∑t=1Tℓt(u) is continuous by [F12], so [F9] gives a minimizer on F. The bound proved for arbitrary u is uniform in u, hence it also holds for the best comparator. For any r∈[0,1), [F10] gives the finite geometric identity (1−r)∑k=0Nrk=∑k=0N(rk−rk+1)=1−rN+1≤1. For β1,t=β1λt−1, use t≤t and reindex the finite sum to obtain ∑t=1Ttλt−1=∑j=1T∑t=jTλt−1≤11−λ∑j=1Tλj−1≤1(1−λ)2 so ∑tβ1,tt is bounded independently of T. For β1,t=β1/t, it is at most β1∑t=1T1/t≤2β1T by step 1.2. Therefore the second term is bounded by a constant for the geometric schedule and by a constant times T for the reciprocal schedule; both give RT=O(T).

Remarks

The theorem concerns online convex loss regret under the stated schedules. It does not imply convergence of a nonconvex neural-network training objective. A constant positive β1,t=β1 is not one of the two schedules in the O(T) conclusion.

Depends on

Used by

Dependency tree · two levels

77 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources