Corollary 2.2 — for with a minimizer
ProvedSDEConvexOpt.corollary_2_2convex-optimizationgradient-flowmartingalesp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-differential-equations
Let and let , i.e. is continuously differentiable and is -Lipschitz continuous, and assume . Then
No convexity is assumed. In the proof of Theorem 3.1(iii) this bound turns the integrability of into that of .
Differences from the source:
- encoding: ; with →
⨅ y, f y;ContDiff ℝ 1 f,LipschitzWith L (gradient f)withL : ℝ≥0, onSDEState d; reason: the infimum is the minimum since ; the class of p.6
Preamble
import Definitions.Def_EthierKurtz_SDEState import Definitions.Def_SDEConvexOpt_argminSet open MeasureTheory ProbabilityTheory Filter open scoped NNReal ENNReal Topology InnerProductSpace
Formal statement
namespace SDEConvexOpt
open EthierKurtz
/-- Corollary 2.2 of Maulen S., Fadili, Attouch, arXiv:2207.02750v1, p.6: let
`f ∈ C^{1,1}_L(ℝ^d)` such that `argmin f ≠ ∅`; then `‖∇f(x)‖² ≤ 2L(f(x) − min f)` for all
`x ∈ ℝ^d`.
**Formalization Note** `C^{1,1}_L(ℝ^d)` (p.6, `L ≥ 0`) is `ContDiff ℝ 1 f` with
`LipschitzWith L (gradient f)`, `L : ℝ≥0`; no convexity is assumed, as on the page. `min f` is
`⨅ y, f y`, the minimum value since `argmin f ≠ ∅`. -/
theorem corollary_2_2 {d : ℕ} (f : SDEState d → ℝ) (L : ℝ≥0) (hf : ContDiff ℝ 1 f)
(hL : LipschitzWith L (gradient f)) (hS : (argminSet f).Nonempty) (x : SDEState d) :
‖gradient f x‖ ^ 2 ≤ 2 * (L : ℝ) * (f x - ⨅ y, f y) := by sorry
end SDEConvexOpt
Source
Maulen S., Fadili, Attouch, An SDE perspective on stochastic convex optimization, arXiv:2207.02750v1, Corollary 2.2, p.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.