Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(37), p. 354 — E(e^{−yF}y|x)/E(e^{−yF}|x) = (P − p(x))/((1 − p(x))P + p(x)(1 − P)), always in [−1, 1]

Proved
AddLogReg.Gentle.eq_37

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

boostinggentle-adaboostlogistic-regressionlogitboostp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ν\nuν be a probability measure on X×{−1,1}X\times\{-1,1\}X×{−1,1}, the joint law of (x,y)(x,y)(x,y), let F:X→RF : X\to\mathbb RF:X→R and fix x∈Xx\in Xx∈X. Let P=P(y=1∣x)P = P(y = 1\mid x)P=P(y=1∣x) and let

p(x)=eF(x)eF(x)+e−F(x)p(x) = \frac{e^{F(x)}}{e^{F(x)}+e^{-F(x)}}p(x)=eF(x)+e−F(x)eF(x)​

be the symmetric logistic of F(x)F(x)F(x). Then

E(e−yF(x)y∣x)E(e−yF(x)∣x)=e−F(x)P−eF(x)(1−P)e−F(x)P+eF(x)(1−P);\frac{E(e^{-yF(x)}y\mid x)}{E(e^{-yF(x)}\mid x)} = \frac{e^{-F(x)}P - e^{F(x)}(1-P)}{e^{-F(x)}P + e^{F(x)}(1-P)};E(e−yF(x)∣x)E(e−yF(x)y∣x)​=e−F(x)P+eF(x)(1−P)e−F(x)P−eF(x)(1−P)​;
e−F(x)P−eF(x)(1−P)e−F(x)P+eF(x)(1−P)=P−p(x)(1−p(x))P+p(x)(1−P);\frac{e^{-F(x)}P - e^{F(x)}(1-P)}{e^{-F(x)}P + e^{F(x)}(1-P)} = \frac{P - p(x)}{(1-p(x))P + p(x)(1-P)};e−F(x)P+eF(x)(1−P)e−F(x)P−eF(x)(1−P)​=(1−p(x))P+p(x)(1−P)P−p(x)​;
  1. this common value always lies in [−1,1][-1, 1][−1,1].

Written in terms of PPP and p(x)p(x)p(x), the Gentle AdaBoost update can be compared directly with the LogitBoost update (38).

Formalization Note P(y=−1∣x)=1−PP(y = -1\mid x) = 1 - PP(y=−1∣x)=1−P is not assumed; it follows from the conditional law being a probability measure. The symmetric logistic is the exact expression above, not 1/(1+e−F(x))1/(1+e^{-F(x)})1/(1+e−F(x)), with which (37) is false.

Preamble
import Mathlib
import Definitions.Def_AddLogReg_Gentle_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace AddLogReg.Gentle

theorem eq_37 {X : Type*} [MeasurableSpace X] (ν : Measure (X × Bool))
    [IsProbabilityMeasure ν] (F : X → ℝ) (x : X) :
    (∫ b, Real.exp (-(AddLogReg.ExpCrit.sgn b * F x)) * AddLogReg.ExpCrit.sgn b ∂(ν.condKernel x)) /
        (∫ b, Real.exp (-(AddLogReg.ExpCrit.sgn b * F x)) ∂(ν.condKernel x)) =
      (Real.exp (-F x) * AddLogReg.ExpCrit.condProb ν true x - Real.exp (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) /
        (Real.exp (-F x) * AddLogReg.ExpCrit.condProb ν true x + Real.exp (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) ∧
    (Real.exp (-F x) * AddLogReg.ExpCrit.condProb ν true x - Real.exp (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) /
        (Real.exp (-F x) * AddLogReg.ExpCrit.condProb ν true x + Real.exp (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) =
      (AddLogReg.ExpCrit.condProb ν true x - AddLogReg.LogitBoost.symLogistic (F x)) /
        ((1 - AddLogReg.LogitBoost.symLogistic (F x)) * AddLogReg.ExpCrit.condProb ν true x +
          AddLogReg.LogitBoost.symLogistic (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) ∧
    (AddLogReg.ExpCrit.condProb ν true x - AddLogReg.LogitBoost.symLogistic (F x)) /
        ((1 - AddLogReg.LogitBoost.symLogistic (F x)) * AddLogReg.ExpCrit.condProb ν true x +
          AddLogReg.LogitBoost.symLogistic (F x) * (1 - AddLogReg.ExpCrit.condProb ν true x)) ∈ Set.Icc (-1 : ℝ) 1 := by sorry

end AddLogReg.Gentle
Source
Friedman, Hastie and Tibshirani, Additive logistic regression: a statistical view of boosting, Ann. Statist. 28 (2000), p. 354, §4.4, (37) and the paragraph after (38)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me