Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (3.18) — expected descent of the Newton-like iteration

Proved
StochQuasiNewton.SQN.expected_descent

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

descent-lemmap2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-newtonstochastic-optimization

Let F:Rn→RF:\mathbb R^n\to\mathbb RF:Rn→R be C2C^2C2 with λI≺∇2F(w)≺ΛI\lambda I\prec\nabla^2F(w)\prec\Lambda IλI≺∇2F(w)≺ΛI for all www (3.4), 0<λ,Λ0<\lambda,\Lambda0<λ,Λ. Let wk,ξk,Hkw^k,\xi^k,H_kwk,ξk,Hk​ be a Newton-like iteration (3.14) with step lengths αk>0\alpha^k>0αk>0, constants 0<μ1≤μ20<\mu_1\le\mu_20<μ1​≤μ2​ and γ\gammaγ (see the definition NewtonLikeIteration). Then for every k≥1k\ge1k≥1, F(wk+1)F(w^{k+1})F(wk+1) is integrable and, almost surely,

E[F(wk+1) ∣ Fk]≤F(wk)−αkμ1∥∇F(wk)∥2+Λ2(αkμ2)2γ2.E\big[F(w^{k+1})\,\big|\,\mathcal F_k\big]\le F(w^k)-\alpha^k\mu_1\|\nabla F(w^k)\|^2+\frac\Lambda2(\alpha^k\mu_2)^2\gamma^2 .E[F(wk+1)​Fk​]≤F(wk)−αkμ1​∥∇F(wk)∥2+2Λ​(αkμ2​)2γ2.

This is the one-step descent inequality that drives the convergence analysis of Theorem 3.2.

Formalization Note The paper's Eξk[⋅]E_{\xi^k}[\cdot]Eξk​[⋅] (expectation over ξk\xi^kξk with wkw^kwk fixed) is the conditional expectation given Fk\mathcal F_kFk​. The first line of (3.18) on the page has the typo Eξk[∥∇f(wk,ξk)∥]2E_{\xi^k}[\|\nabla f(w^k,\xi^k)\|]^2Eξk​[∥∇f(wk,ξk)∥]2 for Eξk[∥∇f(wk,ξk)∥2]E_{\xi^k}[\|\nabla f(w^k,\xi^k)\|^2]Eξk​[∥∇f(wk,ξk)∥2]; only the final inequality is stated.

Preamble
import Mathlib
import Definitions.Def_StochQuasiNewton_SQN_FiniteSum
import Definitions.Def_StochQuasiNewton_SQN_NewtonLike

open scoped RealInnerProductSpace
open MeasureTheory
Formal statement
namespace StochQuasiNewton.SQN

/-- Eq. (3.18): for the Newton-like iteration (3.14) on a `C²` objective `F` with
`λ I ≺ ∇²F(w) ≺ Λ I` (3.4), step lengths `α^k > 0`, and the conditions of `NewtonLikeIteration`,
for every `k ≥ 1`, `F(w^{k+1})` is integrable and, almost surely,
`E[F(w^{k+1}) | ℱ_k] ≤ F(w^k) − α^k μ₁ ‖∇F(w^k)‖² + (Λ/2)(α^k μ₂)² γ²`. -/
theorem expected_descent {n : ℕ} {Ω Ξ : Type*} [mΩ : MeasurableSpace Ω] [MeasurableSpace Ξ]
    (P : Measure Ω) [IsProbabilityMeasure P] (ℱ : Filtration ℕ mΩ)
    (F : EuclideanSpace ℝ (Fin n) → ℝ) (hF : ContDiff ℝ 2 F) (lam Lam : ℝ) (hlam : 0 < lam)
    (hLam : 0 < Lam)
    (hHess : ∀ w : EuclideanSpace ℝ (Fin n),
      StrictLoewnerBounds lam Lam (fderiv ℝ (gradient F) w))
    (G : EuclideanSpace ℝ (Fin n) → Ξ → EuclideanSpace ℝ (Fin n)) (γ : ℝ) (α : ℕ → ℝ)
    (hα : ∀ k, 1 ≤ k → 0 < α k) (μ₁ μ₂ : ℝ) (hμ₁ : 0 < μ₁) (hμ : μ₁ ≤ μ₂)
    (w1 : EuclideanSpace ℝ (Fin n)) (w : ℕ → Ω → EuclideanSpace ℝ (Fin n)) (ξ : ℕ → Ω → Ξ)
    (H : ℕ → Ω → Matrix (Fin n) (Fin n) ℝ)
    (hrun : NewtonLikeIteration P ℱ F G γ α μ₁ μ₂ w1 w ξ H) (k : ℕ) (hk : 1 ≤ k) :
    Integrable (fun ω => F (w (k + 1) ω)) P ∧
      P[fun ω => F (w (k + 1) ω) | ℱ k] ≤ᵐ[P] fun ω =>
        F (w k ω) - α k * μ₁ * ‖gradient F (w k ω)‖ ^ 2 + Lam / 2 * (α k * μ₂) ^ 2 * γ ^ 2 := by sorry

end StochQuasiNewton.SQN
Source
Byrd, Hansen, Nocedal, Singer, A Stochastic Quasi-Newton Method for Large-Scale Optimization, SIAM J. Optim. 26(2) (2016), p. 1017, Eq. (3.18)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me