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.

Nesterov accelerated gradient

Definition

Let d≥1 be an integer and let F:Rd→R be continuously Fréchet differentiable: at every w, DF(w) is a linear first-order approximation with normwise remainder tending to zero, and w↦DF(w) is continuous. Write its coordinate gradient as ∇F(w)=(∂jF(w))0≤j<d. Given an initial vector winit∈Rd, an integer horizon T≥1, and prescribed real parameter sequences (αt)1≤t<T with αt>0 and (βt)1≤t<T, initialize w0=w1=winit. For each integer t=1,…,T−1, first set the look-ahead point

w~t:=wt+βt(wt−wt−1),

then set

wt+1:=w~t−αt∇F(w~t).

Output (w0,w1,…,wT). The gradient is evaluated after the look-ahead displacement. When βt=0, that update is the fixed-step gradient-descent update at wt with step size αt.

Depends on

Used by

Dependency tree · two levels

11 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