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 with . Let be nonempty, compact, and convex, choose , and suppose a finite satisfies for every and coordinate . Let be continuous convex losses, choose , and assume for all , where . Run uncorrected AMSGrad with for , fixed , , , and . For a comparator , define ; the best-comparator regret is . Then If, in addition, for a fixed or , then with the other displayed parameters fixed, the best-comparator regret satisfies .
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: means .
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 with , 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.
Facts & Assumptions
Given: The finite horizon, compact convex domain, losses, subgradients, coordinate bounds, AMSGrad update, and parameters in the Statement.
Uncorrected AMSGrad with a coordinatewise historical maximum: , , is nondecreasing in , and the weighted projection uses .
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.
One-step regret inequality for AMSGrad: for each comparator , the one-step loss difference is bounded by a potential difference, two momentum-energy terms, and a first-moment correction term.
The Euclidean inner product on and Laws of finite sums and finite products: weighted squared distances and sums over coordinates expand termwise and telescope.
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 , , and .
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: a continuous real-valued function on a nonempty compact subset of attains a finite minimum.
The natural numbers (von Neumann), Integer powers , Finite sums and finite products, by recursion, and Laws of finite sums and finite products: integer powers obey , and finite sums may be telescoped and reindexed.
The principle of mathematical induction: induction propagates a base bound through every finite moment update.
Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined: the finite sum of the continuous losses is continuous.
Proof
Given: All data and hypotheses in the Statement. Fix an arbitrary comparator .
By [F5] and the one-step inequality [F3], sum over . With , , and , the resulting bound is
The moment recurrence and give by induction; since is the maximum of the raw second moments through round , . Also because for . Thus the first and third terms in the bound are .
Since is nondecreasing and is nonincreasing, and for ; the previous-moment term is zero. Also . Thus the two energy sums in step 1.1 are at most
In the potential sum of step 1.1, drop the final nonpositive term , since . Fix coordinate and put , with . The unpaired first positive potential is at most . For each , pair the positive potential at round with the negative potential from round . Its coefficient difference is The first difference is nonnegative by [F1], [F7], and . The reciprocal difference is nonpositive when ; otherwise it equals . Thus the sum of all first coefficient differences, including the first-round term, is at most , because . Summing coordinates gives The coefficient correction and the explicit last term of step 1.1 together contribute at most because .
Apply [F4] to the energy bound in step 2.1 and combine with step 2.2. Since , this gives the displayed regret inequality.
The cumulative loss is continuous by [F12], so [F9] gives a minimizer on . The bound proved for arbitrary is uniform in , hence it also holds for the best comparator. For any , [F10] gives the finite geometric identity . For , use and reindex the finite sum to obtain so is bounded independently of . For , it is at most by step 1.2. Therefore the second term is bounded by a constant for the geometric schedule and by a constant times for the reciprocal schedule; both give .
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 is not one of the two schedules in the conclusion.
Depends on
- Uncorrected AMSGrad with a coordinatewise historical maximum
- RMSProp, Adam, and AMSGrad moment updates are well-defined
- One-step regret inequality for AMSGrad
- AMSGrad momentum energy is bounded by a coordinatewise weighted gradient sum
- The natural numbers $\mathbb{N}$ (von Neumann)
- Integer powers $a^m$
- The principle of mathematical induction
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Subgradients and the subdifferential of a convex function
- Convex and strictly convex functions on Euclidean convex sets
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Squaring is monotone on the nonnegatives
- Ordered field
- Sign rules for products and monotonicity of multiplication
- Inverses of positives are positive, and reciprocation reverses order
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined
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
- Sashank J. Reddi, Satyen Kale, and Sanjiv Kumar, On the Convergence of Adam and Beyond (standard reference, not scraped)
- Elad Hazan, Introduction to Online Convex Optimization, second edition (standard reference, not scraped)