Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Uncorrected Adam for online convex losses

Definition

Fix a finite horizon T≥1, an initial scalar x1∈[−1,1], a step parameter α>0, moment parameters β1∈[0,1) and β2∈(0,1), a denominator parameter ϵ≥0, and a sequence of scalar gradients g1,…,gT. Set m0=v0=0. At round t, update

mt=β1mt−1+(1−β1)gt,vt=β2vt−1+(1−β2)gt2.

The input is admissible only when vt+ϵ>0 at every update. Set αt=α/t, compute yt+1=xt−αtmt/vt+ϵ, and set xt+1=max⁡(−1,min⁡(1,yt+1)). Thus the iterate is projected onto [−1,1] after the update. Return the trajectory (x1,…,xT+1), whose final iterate is xT+1. The denominator parameter is added inside the square root. No moment bias correction is applied.

Definition references

The natural numbers N (von Neumann): the finite round indices are natural numbers.

Intervals of R: the nine order-convex forms, nondegeneracy, and length: [−1,1] is the closed scalar interval used for initialization and clipping.

Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}: every nonnegative real radicand has a unique nonnegative square root.

Maximum and minimum of a set

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 v^t+ϵ; it is a distinct update convention.

Reddi, Kale, and Kumar, Algorithm 1 and the inside-root epsilon variant

Kingma and Ba, Adam Algorithm 1

Remarks

This is the uncorrected scalar online variant used for the cited regret counterexamples. Its ϵ=0 mode is defined only on gradient sequences with positive vt 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

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