Lemma 4.1, pp. 298–299 — (∇Φ(Π^Φ_X(y)) − ∇Φ(y))⊤(Π^Φ_X(y) − x) ≤ 0 and D_Φ(x, Π^Φ_X(y)) + D_Φ(Π^Φ_X(y), y) ≤ D_Φ(x, y)
OpenConvexOptAlg.MirrorProx.lemma_4_1bregman-divergencebregman-projectionconvex-optimizationmirror-descentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be a norm on a finite-dimensional real space, a compact convex set, a convex open set with and , and a mirror map on with Bregman divergence . Let and , and let be a minimizer of over . Then
which also implies
The lemma says that the Bregman divergence behaves like the squared Euclidean norm with respect to projections (the analogue of Lemma 3.1 for the Euclidean projection). It is used at every projection step of mirror descent and mirror prox.
Formalization Note is given as a point satisfying the minimizer relation, not as a function. The setting hypotheses (compactness of , , , and the mirror map properties) are the standing assumptions of Chapter 4 and §4.1.
Preamble
import Mathlib import Definitions.Def_ConvexOptAlg_MirrorProx_Defs
Formal statement
namespace ConvexOptAlg.MirrorProx
/-- Lemma 4.1 (Bubeck, arXiv:1405.4980v2, pp. 298–299). In the setting of Chapter 4 (a norm on a
finite-dimensional space, `X` compact convex) and §4.1 (`D` convex open, `X ⊆ closure D`,
`X ∩ D ≠ ∅`, `Φ` a mirror map on `D`): let `x ∈ X ∩ D`, `y ∈ D`, and let `z = Π^Φ_X(y)` be a
minimizer of `D_Φ(·, y)` over `X ∩ D`. Then
`(∇Φ(z) − ∇Φ(y))⊤(z − x) ≤ 0`, which also implies `D_Φ(x, z) + D_Φ(z, y) ≤ D_Φ(x, y)`. -/
theorem lemma_4_1 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
(X D : Set E) (hXc : IsCompact X) (hXconv : Convex ℝ X) (hXD : X ⊆ closure D)
(hXDne : (X ∩ D).Nonempty)
(Φ : E → ℝ) (Φ' : E → E →L[ℝ] ℝ) (hΦ : IsMirrorMap D Φ Φ')
(x y z : E) (hx : x ∈ X ∩ D) (hy : y ∈ D) (hz : IsBregmanProj X D Φ Φ' y z) :
(Φ' z - Φ' y) (z - x) ≤ 0 ∧
bregman Φ Φ' x z + bregman Φ Φ' z y ≤ bregman Φ Φ' x y := by sorry
end ConvexOptAlg.MirrorProx
Source
Bubeck, arXiv:1405.4980v2, Lemma 4.1, pp. 298–299