Boosting in the presence of noise
From MaRDI portal
Publication:5921649
DOI10.1016/j.jcss.2004.10.015zbMath1093.68048MaRDI QIDQ5921649
Rocco A. Servedio, Adam Tauman Kalai
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
68Q32: Computational learning theory
Uses Software
Cites Work
- 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
- Unnamed Item