Lemma 4.1, pp. 298–299 — the Bregman projection satisfies D_Φ(x, Π(y)) + D_Φ(Π(y), y) ≤ D_Φ(x, y)
OpenConvexOptAlg.MirrorDescent.lemma_4_1bregman-projectionconvex-optimizationmirror-descentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be compact and convex, let be a mirror map on the convex open set with and , and write for its Bregman divergence. Let , , and let be a Bregman projection of , i.e. a minimizer of over . Then
and
This is the Bregman analogue of the obtuse-angle property of Euclidean projections (Lemma 3.1 of the book); it is what makes the projection step of mirror descent contract Bregman distances to feasible points.
Formalization Note The projection is given as a point satisfying the minimizing property (a relation, not a function); the book notes it exists and is unique. Linear functionals act by application, so is (Φ' z - Φ' y) v.
Preamble
import Mathlib import Definitions.Def_ConvexOptAlg_MirrorDescent_Defs
Formal statement
namespace ConvexOptAlg.MirrorDescent
/-- Bubeck, Lemma 4.1, pp. 298–299. In the standing setting of Ch. 4 (`X` compact convex, `Φ` a
mirror map on `D`, `X ⊆ closure D`, `X ∩ D ≠ ∅`), let `x ∈ X ∩ D`, `y ∈ D`, and let `z` be the
Bregman projection `Π^Φ_X(y)`. Then
`(∇Φ(z) − ∇Φ(y))ᵀ(z − x) ≤ 0` and `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) (Φ : E → ℝ) (Φ' : E → E →L[ℝ] ℝ)
(hset : IsMirrorSetting X D Φ Φ')
(x y z : E) (hx : x ∈ X ∩ D) (hy : y ∈ D)
(hz : IsBregmanProjection X D Φ Φ' y z) :
(Φ' z - Φ' y) (z - x) ≤ 0 ∧
bregman Φ Φ' x z + bregman Φ Φ' z y ≤ bregman Φ Φ' x y := by sorry
end ConvexOptAlg.MirrorDescent
Source
Bubeck, arXiv:1405.4980v2, Lemma 4.1, pp. 298–299 (setting: Ch. 4 preamble, p. 297, and §4.1, p. 298)