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 have an attained minimum , be -smooth, and be -strongly convex with . Let be generated by local SGD, and define where is the batch gradient from the algorithm definition. If , then Expectations are over the finite product law of the sampled indices.
Statement references
Facts & Assumptions
Given: The local-SGD iterates, the finite-sum objective and Euclidean structure in the Statement.
Local SGD with periodic synchronization: at each step the local proposal is . An unsynchronized worker keeps its proposal, while a synchronized worker takes the mean of all proposals.
Descent inequality for a Lipschitz gradient: an -Lipschitz gradient gives .
Finite Jensen inequality for convex functions on : for a convex function, its value at a finite average is at most the average of its values.
The Euclidean inner product on : inner products and squared norms obey the standard Euclidean algebra.
Expectation of a nonnegative or integrable random variable and Expectation agrees with the published finite weighted sum: on the finite product law, expectations equal finite weighted sums.
For all , , is a minimizer, and .
Proof
Averaging the proposals in [F1] gives their mean . Synchronization preserves that mean, so , whether or not this step synchronizes. Fix any past tuple of sampled indices. The current independent uniform indices have finite conditional average by [F2]. Expanding after adding and subtracting , then averaging over the current indices, removes the cross term and gives .
Fix the past tuple and write . Jensen's inequality [F4] gives . Applying [F3] at with and using yields . Strong convexity [A1] gives . Young's inequality, in the form , therefore gives . In the expansion , decompose and average the preceding bounds over . The function-gap coefficient is ; the strong- convexity term is . Hence
Since , the coefficient . Convexity of follows from -strong convexity in [A1]. Jensen [F4] gives and . Thus step 1.2 is at most . Average over the past and substitute into step 1.1 to obtain the claim.
Depends on
- Local SGD with periodic synchronization
- Relaxed inequalities for squared Euclidean norms
- Descent inequality for a Lipschitz gradient
- Gradient of a finite sum is the finite sum of gradients
- Finite Jensen inequality for convex functions on $\mathbb R^n$
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Expectation of a nonnegative or integrable random variable
- Expectation agrees with the published finite weighted sum
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
- Sebastian U. Stich, Local SGD Converges Fast and Communicates Little, Lemma 3.1 and Appendix A (standard reference, not scraped)