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.
Bias-corrected AMSGrad update
Definition
Fix a dimension d at least 1, an initial point x_1 in R^d, a constant step size eta>0, a denominator constant epsilon>0, and parameters beta_1,beta_2 in [0,1). Set m_0=v_0=\widehat v^{\max}_0=0. Given a gradient g_t in R^d at each integer time t>=1, calculate
where \odot and max are coordinatewise. Update
coordinatewise. Each coordinate of v_t and \widehat v^{\max}_t is nonnegative, and the denominator is at least epsilon>0, so every finite update is defined.
This carrier defines a bias-corrected AMSGrad variant under the assigned denominator convention. Reddi–Kale–Kumar's Algorithm 2 takes the running maximum of the uncorrected second-moment recurrence and uses that maximum directly in the denominator; it does not apply Adam's second-moment bias correction. The recurrences are not identified here. No AMSGrad convergence theorem is claimed.
Remarks
For and integer , Monotonicity of and of gives , so each bias-correction denominator is positive. Induction in the second-moment recurrence, Squares of nonzero elements are positive, Sign rules for products and monotonicity of multiplication and Multiplication by zero: give . Division by the positive bias-correction factor preserves nonnegativity by Inverses of positives are positive, and reciprocation reverses order, so and its square root exists by Square roots exist: a unique with ; the positives are . The coordinatewise maximum is the maximum of a two-element real set, which exists by Maximum and minimum of a set and Every nonempty finite set of reals has a maximum and a minimum and is nonnegative because it is one of its two nonnegative entries. Thus every denominator is at least .
Depends on
- The natural numbers $\mathbb{N}$ (von Neumann)
- Integer powers $a^m$
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Ordered field
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- Squares of nonzero elements are positive
- Sign rules for products and monotonicity of multiplication
- Multiplication by zero: $0 \cdot a = 0$
- Inverses of positives are positive, and reciprocation reverses order
- Maximum and minimum of a set
- Every nonempty finite set of reals has a maximum and a minimum
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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, ICLR 2018, full text (standard reference, not scraped)
- John Duchi, Elad Hazan, and Yoram Singer, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization, JMLR 12 (2011) (standard reference, not scraped)