Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.9), p. 7 — summed RSG descent: Σ(γ_k − Lγ_k²/2)‖∇f(x_k)‖² ≤ f(x_1) − f* − Σ(γ_k − Lγ_k²)⟨∇f(x_k), δ_k⟩ + (L/2)Σγ_k²‖δ_k‖²

Proved
GhadimiLan.RSG.eq_2_9

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

nonconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sgdstochastic-approximation

Let f∈CL1,1(Rn)f\in\mathcal C^{1,1}_L(\mathbb R^n)f∈CL1,1​(Rn) be bounded below with f∗=inf⁡xf(x)f^*=\inf_x f(x)f∗=infx​f(x), let x1,x2,…x_1,x_2,\dotsx1​,x2​,… be an RSG run xk+1=xk−γkG(xk,ξk)x_{k+1}=x_k-\gamma_kG(x_k,\xi_k)xk+1​=xk​−γk​G(xk​,ξk​) from x1x_1x1​, and let δk=G(xk,ξk)−∇f(xk)\delta_k=G(x_k,\xi_k)-\nabla f(x_k)δk​=G(xk​,ξk​)−∇f(xk​). Then for every N≥1N\ge1N≥1 and every outcome,

∑k=1N(γk−L2γk2)∥∇f(xk)∥2≤f(x1)−f(xN+1)−∑k=1N(γk−Lγk2)⟨∇f(xk),δk⟩+L2∑k=1Nγk2∥δk∥2,\sum_{k=1}^N\Big(\gamma_k-\frac L2\gamma_k^2\Big)\|\nabla f(x_k)\|^2\le f(x_1)-f(x_{N+1})-\sum_{k=1}^N\big(\gamma_k-L\gamma_k^2\big)\langle\nabla f(x_k),\delta_k\rangle+\frac L2\sum_{k=1}^N\gamma_k^2\|\delta_k\|^2,k=1∑N​(γk​−2L​γk2​)∥∇f(xk​)∥2≤f(x1​)−f(xN+1​)−k=1∑N​(γk​−Lγk2​)⟨∇f(xk​),δk​⟩+2L​k=1∑N​γk2​∥δk​∥2,

and the same inequality holds with f(xN+1)f(x_{N+1})f(xN+1​) replaced by f∗f^*f∗.

The right-hand side no longer depends on the last iterate; taking expectations of this pathwise bound is the next step of the proof of Theorem 2.1.

Formalization Note f∗f^*f∗ is the greatest lower bound of the range of fff (IsGLB (Set.range f) fstar). Both inequalities of the display are stated, as a conjunction.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_SmoothGD_Defs
import Definitions.Def_GhadimiLan_RSG_Model
open MeasureTheory ProbabilityTheory
open scoped InnerProductSpace
Formal statement
namespace GhadimiLan.RSG

/-- Eq. (2.9) (Ghadimi & Lan, arXiv:1309.5549v1, proof of Theorem 2.1, p. 7): for
`f ∈ C^{1,1}_L(ℝⁿ)` with gradient map `g = ∇f`, `f* = inf f`, an RSG run `x` from `x1` and
`N ≥ 1`, for every outcome `ω` (with `δ_k = G(x_k, ξ_k) − ∇f(x_k)`):
`Σ_{k=1}^N (γ_k − (L/2)γ_k²)‖∇f(x_k)‖² ≤ f(x_1) − f(x_{N+1}) − Σ_{k=1}^N (γ_k − Lγ_k²)⟨∇f(x_k), δ_k⟩ + (L/2)Σ_{k=1}^N γ_k²‖δ_k‖²`,
and the same with `f(x_{N+1})` replaced by `f*`. Pathwise. -/
theorem eq_2_9 {n : ℕ} (f : E n → ℝ) (g : E n → E n) (L : ℝ)
    (hf : ConvexOptAlg.SmoothGD.IsBetaSmooth f g L)
    (fstar : ℝ) (hfstar : IsGLB (Set.range f) fstar)
    {Ω Ξ : Type*} (G : E n → Ξ → E n) (γ : ℕ → ℝ) (x1 : E n) (ξ : ℕ → Ω → Ξ)
    (x : ℕ → Ω → E n) (hx : IsRSGRun G γ x1 ξ x) (N : ℕ) (hN : 1 ≤ N) (ω : Ω) :
    (∑ k ∈ Finset.Icc 1 N, (γ k - L / 2 * γ k ^ 2) * ‖g (x k ω)‖ ^ 2 ≤
      f x1 - f (x (N + 1) ω)
        - ∑ k ∈ Finset.Icc 1 N, (γ k - L * γ k ^ 2) * ⟪g (x k ω), rsgNoise G g ξ x k ω⟫_ℝ
        + L / 2 * ∑ k ∈ Finset.Icc 1 N, γ k ^ 2 * ‖rsgNoise G g ξ x k ω‖ ^ 2) ∧
    ∑ k ∈ Finset.Icc 1 N, (γ k - L / 2 * γ k ^ 2) * ‖g (x k ω)‖ ^ 2 ≤
      f x1 - fstar
        - ∑ k ∈ Finset.Icc 1 N, (γ k - L * γ k ^ 2) * ⟪g (x k ω), rsgNoise G g ξ x k ω⟫_ℝ
        + L / 2 * ∑ k ∈ Finset.Icc 1 N, γ k ^ 2 * ‖rsgNoise G g ξ x k ω‖ ^ 2 := by sorry

end GhadimiLan.RSG
Source
Ghadimi & Lan, arXiv:1309.5549v1, proof of Theorem 2.1, Eq. (2.9), p. 7
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me