Proof of Thm 31 (p. 37) — margin tail: w.p. ≥ (1 − γ)/2, ⟨w, yx⟩ ≤ (a_n/γ)‖w‖₁
ProvedRobustGeneralization.BernLower.margin_tail_boundbernoulli-modelmarkov-inequalityp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1tail-bound
Let , and . Let with for all , and let follow the product law on with independent coordinates of means . Given , let be a fresh sample from the -Bernoulli model. Then for every , with ,
In the proof of Theorem 31 this is applied conditionally on the sample set : given , the posterior of is a product law whose coordinate means satisfy , so is the page's shorthand. The statement here is the general product-law form that the argument uses.
Formalization Note The probability is the finite sum . . The bound (with ) makes a probability law and .
Preamble
import Mathlib import Definitions.Def_RobustGeneralization_BernLower_Model
Formal statement
namespace RobustGeneralization.BernLower
theorem margin_tail_bound (d : ℕ) (τ b γ : ℝ) (hτ : 0 < τ) (hτ' : τ ≤ 1 / 2)
(hb : 0 ≤ b) (hb' : b ≤ 1) (m : Fin d → ℝ) (hm : ∀ i, |m i| ≤ b) (w : E d) (hγ : 0 < γ) :
(1 - γ) / 2 ≤ ∑ θ : Fin d → Bool, prodLaw m θ * ∑ p : (Fin d → Bool) × Bool,
bernW θ τ p *
(if lab p.2 * inner ℝ w (pm p.1) ≤ (2 * τ * b / γ) * ∑ i, |w i| then 1 else 0) := by sorry
end RobustGeneralization.BernLower
Source
Schmidt, Santurkar, Tsipras, Talwar, Mądry, Adversarially Robust Generalization Requires More Data, arXiv:1804.11285v2, p. 37, §B.2, proof of Theorem 31, from 'To simplify the following calculation' to '⟨w, yx⟩ ≤ (a_n/γ)‖w‖₁'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.