Proof of Theorem 2.1, p. 22 — pathwise bound on ‖x_k − x⋆ − γ∇f_i(x_k)‖² via Jensen and co-coercivity
ProvedSGDKaczmarz.SGD.step_boundco-coercivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-gradient-descent
Let be a real Hilbert space and a differentiable convex function (playing one component ) whose gradient is Lipschitz with constant . For all points (the current iterate ) and , and every real step ,
This is the first display of the proof of Theorem 2.1: one SGD step , bounded for every sampled index before any expectation is taken.
Formalization Note The bound is deterministic: it holds for every component and every point, so it is stated for a single function with constant .
Preamble
import Mathlib open scoped NNReal InnerProductSpace
Formal statement
namespace SGDKaczmarz.SGD
/-- Proof of Theorem 2.1 (Appendix A.2), p. 22, first display: the pathwise one-step bound for one
component `g = f_i` with Lipschitz constant `Li = L_i`, current point `x = x_k`. -/
theorem step_bound {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(g : H → ℝ) (hg : Differentiable ℝ g) (hconv : ConvexOn ℝ Set.univ g) (Li : ℝ≥0)
(hL : LipschitzWith Li (gradient g)) (x xstar : H) (γ : ℝ) :
‖x - xstar - γ • gradient g x‖ ^ 2
≤ ‖x - xstar‖ ^ 2 - 2 * γ * ⟪x - xstar, gradient g x⟫_ℝ
+ 2 * γ ^ 2 * Li * ⟪x - xstar, gradient g x - gradient g xstar⟫_ℝ
+ 2 * γ ^ 2 * ‖gradient g xstar‖ ^ 2 := by sorry
end SGDKaczmarz.SGD
Source
Needell, Srebro & Ward, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, arXiv:1310.5715v5, proof of Theorem 2.1 (Appendix A.2), first display, p. 22
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.