§5.1, p. 7 — a swap-local optimum of has for every base
ProvedCurvatureSubmod.LocalSearch.local_opt_boundlocal-searchmatroidp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular
Let be a finite set, monotone increasing and submodular, linear with arbitrary real weights, and with the Filmus–Ward potential of . Let be a matroid on and a base of that is locally optimal for under single-element exchanges: whenever , and is a base. Then for every base of ,
This is the exact () form of the guarantee required by Theorem 3.1, obtained from the local search of §5.
Formalization Note "Locally optimal" is Figure 4's stopping rule with (IsSwapLocalOpt). As in Lemma 5.2, is monotone and nonnegative.
Preamble
import Mathlib import Definitions.Def_NonmonotoneSubmod_Shared_Submodular import Definitions.Def_CurvatureSubmod_LocalSearch_Setting
Formal statement
namespace CurvatureSubmod.LocalSearch
/-- §5.1, p. 7 (paragraph after the proof of Lemma 5.2): a swap-local optimum `S` of `ψ`
satisfies `g(S) + ℓ(S) ≥ (1 − e^{−1}) g(O) + ℓ(O)` for every base `O`. -/
theorem local_opt_bound {X : Type} [Fintype X] [DecidableEq X] (g : Finset X → ℝ)
(hg0 : ∀ A, 0 ≤ g A) (hgmono : MonoInc g) (hgsub : NonmonotoneSubmod.Shared.Submodular g)
(w : X → ℝ) (M : Matroid X) (S : Finset X) (hS : IsSwapLocalOpt M (psi g w) S)
(O : Finset X) (hO : M.IsBase (↑O : Set X)) :
(1 - Real.exp (-1)) * g O + linFun w O ≤ g S + linFun w S := by sorry
end CurvatureSubmod.LocalSearch
Source
Sviridenko, Vondrák, Ward, Optimal approximation for submodular and supermodular optimization with bounded curvature (SODA 2015 version, Oct. 9, 2014), p. 7, §5.1, paragraph after the proof of Lemma 5.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.