Lemma 12.2, first claim — distance to a convex set is convex
ProvedModernOnlineLearning.Reductions.lemma_12_2_convexconvex-analysisdistance-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be a nonempty closed convex set in a finite-dimensional real normed space, and let be the distance from to . Then
This establishes convexity of the distance term in the surrogate losses of Theorem 12.5.
Preamble
import Mathlib import Definitions.Def_ModernOnlineLearning_Reductions_Setting
Formal statement
namespace ModernOnlineLearning.Reductions
/-- Orabona, Lemma 12.2, first claim, p. 193. -/
theorem lemma_12_2_convex {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
[FiniteDimensional ℝ E] (V : Set E) (hV : V.Nonempty)
(hclosed : IsClosed V) (hconv : Convex ℝ V) :
ConvexOn ℝ Set.univ (distance V) := by sorry
end ModernOnlineLearning.Reductions
Source
Orabona, arXiv:1912.13213v10, Lemma 12.2, first claim, p. 193
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.