Theorem 15.8: the homogenous Hard-SVM solution w₀ is a linear combination of the support vectors {xᵢ : |⟨w₀,xᵢ⟩| = 1}
ProvedUnderstandingML.support_vectorsoptimality-conditionssupport-vector-machinessupport-vectors
Theorem 15.8. Let be as defined in Equation (15.3) and let . Then there exist coefficients such that . The examples are called support vectors.
Formally: labels in ; the coefficients vanish outside .
Preamble
import Definitions.Def_UnderstandingML_SVM open MeasureTheory open scoped InnerProductSpace
Formal statement
namespace UnderstandingML
/-- **Theorem 15.8** (p. 210). Let `w₀` be the solution of the homogenous Hard-SVM problem (15.3)
and let `I = {i : |⟨w₀, xᵢ⟩| = 1}`. Then there exist coefficients `α₁, …, α_m` such that
`w₀ = ∑_{i ∈ I} αᵢ xᵢ`; the examples `{xᵢ : i ∈ I}` are the support vectors. Labels in `{±1}`. -/
theorem support_vectors {d m : ℕ} (x : Fin m → Vec d) (y : Fin m → ℝ)
(hy : ∀ i, y i = 1 ∨ y i = -1) (w₀ : Vec d) (h : IsHomHardSVM x y w₀) :
∃ α : Fin m → ℝ, (∀ i, |⟪w₀, x i⟫_ℝ| ≠ 1 → α i = 0) ∧ w₀ = ∑ i, α i • x i := by sorry
end UnderstandingML
Source
Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms, Cambridge University Press 2014, doi:10.1017/CBO9781107298019, §15.3 p. 210, Theorem 15.8 (from Lemma 15.9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.