Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix E.1, equation (8) — DARE output concentration

Proved
DAREx.DAREOutputConcentration

by Minghui · Sep 29, 2026 · Mathlib c5ea003 (Lean v4.30.0)

delta-parameter-pruningmachine-learningprobability

Notation. Ω={0,1}n\Omega=\{0,1\}^nΩ={0,1}n is the finite space of Bernoulli drop masks; nnn is the number of coordinates and ppp is the drop probability. Coefficients are fixed before drawing the mask. For n>0n>0n>0, fix any real influence coefficients cj=ΔWjxjc_j=\Delta W_jx_jcj​=ΔWj​xj​. Set cˉ=n−1∑jcj\bar c=n^{-1}\sum_jc_jcˉ=n−1∑j​cj​ and σ2=n−1∑j(cj−cˉ)2\sigma^2=n^{-1}\sum_j(c_j-\bar c)^2σ2=n−1∑j​(cj​−cˉ)2. Let 0<p<10<p<10<p<1 be the drop probability and 0<γ<10<\gamma<10<γ<1 the allowed failure probability. Draw independent Bernoulli(ppp) drop indicators ωj\omega_jωj​ and define H=∑jcj(1−(1−ωj)/(1−p))H=\sum_jc_j(1-(1-\omega_j)/(1-p))H=∑j​cj​(1−(1−ωj​)/(1−p)). Put Φ(1/2)=1/2\Phi(1/2)=1/2Φ(1/2)=1/2 and Φ(p)=(1−2p)/log⁡((1−p)/p)\Phi(p)=(1-2p)/\log((1-p)/p)Φ(p)=(1−2p)/log((1−p)/p) otherwise. Then

Pr⁡{∣H∣≤Φ(p)1−pn(cˉ2+σ2)log⁡(2/γ)}≥1−γ.\Pr\left\{|H|\le\frac{\sqrt{\Phi(p)}}{1-p}\sqrt{n(\bar c^2+\sigma^2)}\sqrt{\log(2/\gamma)}\right\}\ge1-\gamma.Pr{∣H∣≤1−pΦ(p)​​n(cˉ2+σ2)​log(2/γ)​}≥1−γ.

There is no nonzero-coefficient or positive-energy hypothesis. Formalization note: equation (8), using the source's coefficient-energy identity, with an explicit continuous value at p=1/2p=1/2p=1/2. This is not the piecewise formula printed in Theorem 3.1: the missing square root and the one-sided high-pruning refinement are not imported. The mission description explains the distinction.

Source: Deng et al., DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models, ICLR 2025, arXiv:2410.09344v2, https://arxiv.org/pdf/2410.09344v2, Appendix E.1, PDF p. 30, equation (8); PDF p. 31, unnumbered coefficient-energy identity; Section 3.2, PDF p. 5, equation (2) and Theorem 3.1 notation.

Preamble
import Definitions.Def_DAREx_Model
Formal statement
namespace DAREx
theorem DAREOutputConcentration :
  ∀ (n : ℕ) (c : Fin n → ℝ) (p γ : ℝ),
    0 < n → 0 < p → p < 1 → 0 < γ → γ < 1 →
    1 - γ ≤ probability p (fun ω ↦ |dareError p c ω| ≤
      Real.sqrt (phi p) / (1 - p) *
        Real.sqrt ((n : ℝ) * (empiricalMean c ^ 2 + empiricalVariance c)) *
        Real.sqrt (Real.log (2 / γ))) := by sorry
end DAREx
Source
Deng et al., DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models, ICLR 2025, arXiv:2410.09344v2, https://arxiv.org/pdf/2410.09344v2, Appendix E.1, PDF p. 30, equation (8); PDF p. 31, unnumbered coefficient-energy identity; Section 3.2, PDF p. 5, equation (2) and Theorem 3.1 notation.
Read-back

What the Lean code literally says, in plain math · inherited model (exact model identifier unavailable)

This open theorem asserts that, for every natural number nnn, every real coefficient family c:In→Rc:I_n\to\mathbb Rc:In​→R with In={0,…,n−1}I_n=\{0,\ldots,n-1\}In​={0,…,n−1}, and every pair of real numbers p,γp,\gammap,γ satisfying 0<n0<n0<n, 0<p<10<p<10<p<1, and 0<γ<10<\gamma<10<γ<1, one has 1−γ≤∑ω∈Ωn: ∣D(ω)∣≤Rwp(ω)1-\gamma\le\sum_{\omega\in\Omega_n:\ |D(\omega)|\le R}w_p(\omega)1−γ≤∑ω∈Ωn​: ∣D(ω)∣≤R​wp​(ω), where R=ϕ(p)1−pn(cˉ 2+sc2)log⁡(2/γ)R=\dfrac{\sqrt{\phi(p)}}{1-p}\sqrt{n(\bar c^{\,2}+s_c^2)}\sqrt{\log(2/\gamma)}R=1−pϕ(p)​​n(cˉ2+sc2​)​log(2/γ)​, cˉ=(∑j∈Incj)/n\bar c=(\sum_{j\in I_n}c_j)/ncˉ=(∑j∈In​​cj​)/n, and sc2=(∑j∈In(cj−cˉ)2)/ns_c^2=(\sum_{j\in I_n}(c_j-\bar c)^2)/nsc2​=(∑j∈In​​(cj​−cˉ)2)/n. The natural number nnn is interpreted as a real number in these formulas and the variance uses denominator nnn, not n−1n-1n−1. Here Ωn={false,true}In\Omega_n=\{\mathsf{false},\mathsf{true}\}^{I_n}Ωn​={false,true}In​, wp(ω)=∏j∈Inap(ωj)w_p(\omega)=\prod_{j\in I_n}a_p(\omega_j)wp​(ω)=∏j∈In​​ap​(ωj​) with ap(true)=pa_p(\mathsf{true})=pap​(true)=p and ap(false)=1−pa_p(\mathsf{false})=1-pap​(false)=1−p, so the sum is the probability for independent Boolean coordinates each true with probability ppp; D(ω)=∑j∈In(cj−hj(ωj))D(\omega)=\sum_{j\in I_n}(c_j-h_j(\omega_j))D(ω)=∑j∈In​​(cj​−hj​(ωj​)), where hj(true)=0h_j(\mathsf{true})=0hj​(true)=0 and hj(false)=cj/(1−p)h_j(\mathsf{false})=c_j/(1-p)hj​(false)=cj​/(1−p); and ϕ(p)=12\phi(p)=\tfrac12ϕ(p)=21​ if p=12p=\tfrac12p=21​, otherwise ϕ(p)=(1−2p)/log⁡((1−p)/p)\phi(p)=(1-2p)/\log((1-p)/p)ϕ(p)=(1−2p)/log((1−p)/p). The square roots are real square roots, with the total convention that a nonpositive input has square root 000. The good event uses the weak inequality ∣D(ω)∣≤R|D(\omega)|\le R∣D(ω)∣≤R and is centered at error 000. There is no positivity assumption on ∑jcj2\sum_jc_j^2∑j​cj2​, no separate assumption about ϕ(p)\phi(p)ϕ(p), and no sign or nonzero restriction on the coefficients. In particular, the identically zero coefficient family is included: then D=R=0D=R=0D=R=0 and the event contains every mask. The case n=0n=0n=0 is excluded, but n=1n=1n=1 is included and has sc2=0s_c^2=0sc2​=0; both endpoints of each interval for ppp and γ\gammaγ are excluded. The supplied proof slot is a placeholder; no completed proof is supplied.

Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Minghui · Sep 29, 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