Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Thm 31 (p. 37) — margin tail: w.p. ≥ (1 − γ)/2, ⟨w, yx⟩ ≤ (a_n/γ)‖w‖₁

Proved
RobustGeneralization.BernLower.margin_tail_bound

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

bernoulli-modelmarkov-inequalityp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1tail-bound

Let 0<τ≤120<\tau\le\tfrac120<τ≤21​, 0≤b≤10\le b\le10≤b≤1 and γ>0\gamma>0γ>0. Let m∈Rdm\in\mathbb R^dm∈Rd with ∣mi∣≤b|m_i|\le b∣mi​∣≤b for all iii, and let θ⋆\theta^\starθ⋆ follow the product law ρm\rho_mρm​ on {±1}d\{\pm1\}^d{±1}d with independent coordinates of means E[θi⋆]=mi\mathbb E[\theta^\star_i]=m_iE[θi⋆​]=mi​. Given θ⋆\theta^\starθ⋆, let (x,y)(x,y)(x,y) be a fresh sample from the (θ⋆,τ)(\theta^\star,\tau)(θ⋆,τ)-Bernoulli model. Then for every w∈Rdw\in\mathbb R^dw∈Rd, with a=2τba=2\tau ba=2τb,

Pr⁡θ⋆∼ρm, (x,y)[⟨w,yx⟩≤aγ∥w∥1]≥1−γ2.\Pr_{\theta^\star\sim\rho_m,\ (x,y)}\Big[\langle w,yx\rangle\le\frac{a}{\gamma}\|w\|_1\Big]\ge\frac{1-\gamma}{2}.θ⋆∼ρm​, (x,y)Pr​[⟨w,yx⟩≤γa​∥w∥1​]≥21−γ​.

In the proof of Theorem 31 this is applied conditionally on the sample set SSS: given SSS, the posterior of θ⋆\theta^\starθ⋆ is a product law whose coordinate means satisfy ∣E[θi⋆∣S]∣≤b=15τ2nlog⁡(4d/γ)|\mathbb E[\theta^\star_i\mid S]|\le b=15\tau\sqrt{2n\log(4d/\gamma)}∣E[θi⋆​∣S]∣≤b=15τ2nlog(4d/γ)​, so a=an=30τ22nlog⁡(4d/γ)a=a_n=30\tau^2\sqrt{2n\log(4d/\gamma)}a=an​=30τ22nlog(4d/γ)​ 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 ∑θρm(θ)∑(x,y)Pθ,τ(x,y) 1[⋅]\sum_\theta\rho_m(\theta)\sum_{(x,y)}P_{\theta,\tau}(x,y)\,\mathbf 1[\cdot]∑θ​ρm​(θ)∑(x,y)​Pθ,τ​(x,y)1[⋅]. ∥w∥1=∑i∣wi∣\|w\|_1=\sum_i|w_i|∥w∥1​=∑i​∣wi​∣. The bound b≤1b\le1b≤1 (with τ≤12\tau\le\tfrac12τ≤21​) makes ρm\rho_mρm​ a probability law and a≤1a\le1a≤1.

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
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me