OurBigBook About$ Donate
 Sign in Sign up

AdaBoost training error bound (R01​≤∏m​2ϵm​(1−ϵm​)​≤e−2∑m​γm2​)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Statistical learning theory AdaBoost Exponential-loss derivation of AdaBoost
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For AdaBoost with initial uniform weights, labels and base predictions in {−1,1}, and edges γm​=1/2−ϵm​>0, the training exponential classification risk equals the product of stage normalizers. A wrongly classified point has exponential loss at least one, so empirical classification error is bounded by this product. The final inequality uses 1−4γm2​​≤e−2γm2​. The result concerns training error, not a guarantee against overfitting or mislabeled observations.
// Target: probability-and-statistics.bigb

 Ancestors (7)

  1. Exponential-loss derivation of AdaBoost
  2. AdaBoost
  3. Statistical learning theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 45 / 3 / b / Solution
  • Weak learner

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook