Boosting in the presence of noise

DOI10.1016/j.jcss.2004.10.015zbMath1093.68048OpenAlexW2098933520MaRDI QIDQ5921649

Adam Tauman Kalai, Rocco A. Servedio

Publication date: 10 October 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.10.015

zbMATH Keywords

computational learning theoryPAC learningbranching programsboostingnoise-tolerant learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Noise peeling methods to improve boosting algorithms, Stochastic optimization for real time service capacity allocation under random service demand, Unnamed Item, Random classification noise defeats all convex potential boosters, On the noise estimation statistics, Boosting in the Presence of Outliers: Adaptive Classification With Nonconvex Loss Functions, Soft-max boosting

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• A polynomial-time algorithm for learning noisy linear threshold functions
• Specification and simulation of statistical query algorithms for efficiency and noise tolerance
• On the boosting ability of top-down decision tree learning algorithms
• A decision-theoretic generalization of on-line learning and an application to boosting
• Boosting using branching programs
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Boosting a weak learning algorithm by majority
• Efficient noise-tolerant learning from statistical queries
• A Pseudorandom Generator from any One-way Function
• Cryptographic limitations on learning Boolean formulae and finite automata
• Learning Theory