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.
Uncorrected Adam for online convex losses
Definition
Fix a finite horizon , an initial scalar , a step parameter , moment parameters and , a denominator parameter , and a sequence of scalar gradients . Set . At round , update
The input is admissible only when at every update. Set , compute , and set . Thus the iterate is projected onto after the update. Return the trajectory , whose final iterate is . The denominator parameter is added inside the square root. No moment bias correction is applied.
Definition references
The natural numbers (von Neumann): the finite round indices are natural numbers.
Intervals of : the nine order-convex forms, nondegeneracy, and length: is the closed scalar interval used for initialization and clipping.
Square roots exist: a unique with ; the positives are : every nonnegative real radicand has a unique nonnegative square root.
Every nonempty finite set of reals has a maximum and a minimum: the displayed clipping operation is the maximum and minimum of finite real sets.
Bias-corrected Adam update: the published bias-corrected Adam procedure instead divides by ; it is a distinct update convention.
Reddi, Kale, and Kumar, Algorithm 1 and the inside-root epsilon variant
Remarks
This is the uncorrected scalar online variant used for the cited regret counterexamples. Its mode is defined only on gradient sequences with positive at every round; the counterexample sequences in the theorem meet that condition. The fixed- mode uses the source's addition inside the square root, not the published bias-corrected denominator convention.
Depends on
- The natural numbers $\mathbb{N}$ (von Neumann)
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Squares of nonzero elements are positive
- Multiplication by zero: $0 \cdot a = 0$
- Ordered field
- Sign rules for products and monotonicity of multiplication
- The Cauchy-sequence reals have the least-upper-bound property
- Maximum and minimum of a set
- Every nonempty finite set of reals has a maximum and a minimum
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
Used by
Dependency tree · two levels
41 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)
- Diederik P. Kingma and Jimmy Ba, Adam: A Method for Stochastic Optimization (standard reference, not scraped)