Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

One-step progress of the virtual local-SGD iterate

Statement

Let f=n−1∑j=1nfj have an attained minimum f⋆=f(x⋆), be L-smooth, and be μ-strongly convex with 0<μ≤L. Let xt1,…,xtK be generated by local SGD, and define xˉt=1K∑k=1Kxtk,gt=1K∑k=1Kgtk(xtk),gˉt=1K∑k=1K∇f(xtk), where gtk is the batch gradient from the algorithm definition. If ηt≤1/(4L), then E∥xˉt+1−x⋆∥22≤(1−μηt)E∥xˉt−x⋆∥22+ηt2E∥gt−gˉt∥22−ηt2E[f(xˉt)−f⋆]+2ηtLK∑k=1KE∥xˉt−xtk∥22. Expectations are over the finite product law of the sampled indices.

Facts & Assumptions

Given: The local-SGD iterates, the finite-sum objective and Euclidean structure in the Statement.

[F1]

Local SGD with periodic synchronization: at each step the local proposal is zt+1k=xtk−ηtgtk(xtk). An unsynchronized worker keeps its proposal, while a synchronized worker takes the mean of all proposals.

[F2]

Gradient of a finite sum is the finite sum of gradients: ∇f(x)=n−1∑j∇fj(x).

[F3]

Descent inequality for a Lipschitz gradient: an L-Lipschitz gradient gives f(y)≤f(x)+⟨∇f(x),y−x⟩+(L/2)∥y−x∥22.

[F4]

Finite Jensen inequality for convex functions on Rn: for a convex function, its value at a finite average is at most the average of its values.

[F5]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: inner products and squared norms obey the standard Euclidean algebra.

[F6]
[A1]

For all u,v∈Rd, f(v)≥f(u)+⟨∇f(u),v−u⟩+(μ/2)∥v−u∥22, x⋆ is a minimizer, and ∇f(x⋆)=0.

Proof

1.1F1F2F5F6givenalgebra

Averaging the proposals in [F1] gives their mean xˉt−ηtgt. Synchronization preserves that mean, so xˉt+1=xˉt−ηtgt, whether or not this step synchronizes. Fix any past tuple of sampled indices. The current independent uniform indices have finite conditional average gˉt by [F2]. Expanding after adding and subtracting ηtgˉt, then averaging over the current indices, removes the cross term and gives E∥xˉt+1−x⋆∥22=E∥xˉt−x⋆−ηtgˉt∥22+ηt2E∥gt−gˉt∥22.

1.2A1F3F4F5givenalgebra

Fix the past tuple and write xk=xtk. Jensen's inequality [F4] gives ∥gˉt∥22≤K−1∑k∥∇f(xk)∥22. Applying [F3] at xk with y=xk−L−1∇f(xk) and using f(x⋆)≤f(y) yields ∥∇f(xk)∥22≤2L(f(xk)−f⋆). Strong convexity [A1] gives −⟨xk−x⋆,∇f(xk)⟩≤−(f(xk)−f⋆)−(μ/2)∥xk−x⋆∥22. Young's inequality, in the form −2⟨u,v⟩≤2L∥u∥22+(2L)−1∥v∥22, therefore gives −2⟨xˉt−xk,∇f(xk)⟩≤2L∥xˉt−xk∥22+f(xk)−f⋆. In the expansion ∥xˉt−x⋆−ηtgˉt∥22=∥xˉt−x⋆∥22−2ηt⟨xˉt−x⋆,gˉt⟩+ηt2∥gˉt∥22, decompose xˉt−x⋆=(xˉt−xk)+(xk−x⋆) and average the preceding bounds over k. The function-gap coefficient is −2ηt+ηt+2ηt2L=2ηt(ηtL−12); the strong- convexity term is −μηtK−1∑k∥xk−x⋆∥22. Hence ∥xˉt−x⋆−ηtgˉt∥22≤∥xˉt−x⋆∥22+2ηtLK∑k∥xˉt−xk∥22+2ηt(ηtL−12)1K∑k(f(xk)−f⋆)−μηtK∑k∥xk−x⋆∥22.

2.1A1F4step 1.1step 1.2givenalgebra∎

Since ηtL≤1/4, the coefficient 2ηt(ηtL−12)≤−ηt/2. Convexity of f follows from μ-strong convexity in [A1]. Jensen [F4] gives K−1∑kf(xk)≥f(xˉt) and K−1∑k∥xk−x⋆∥22≥∥xˉt−x⋆∥22. Thus step 1.2 is at most (1−μηt)∥xˉt−x⋆∥22−(ηt/2)(f(xˉt)−f⋆)+(2ηtL/K)∑k∥xˉt−xk∥22. Average over the past and substitute into step 1.1 to obtain the claim.

Depends on

Used by

Dependency tree · two levels

43 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