Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning in the presence of malicious errors
SIAM Journal on Computing
Statistical queries and faulty PAC oracles
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Fat-shattering and the learnability of real-valued functions
Journal of Computer and System Sciences
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Learning nested differences in the presence of malicious noise
Theoretical Computer Science - Special issue on algorithmic learning theory
General convergence results for linear discriminant updates
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Large margin classification using the perceptron algorithm
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Specification and simulation of statistical query algorithms for efficiency and noise tolerance
Journal of Computer and System Sciences - Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995
Learning conjuctions with noise under product distributions
Information Processing Letters
Generalization performance of support vector machines and other pattern classifiers
Advances in kernel methods
The robustness of the p-norm algorithms
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
An adaptive version of the boost by majority algorithm
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Sample-efficient strategies for learning in the presence of noise
Journal of the ACM (JACM)
On-line learning with malicious noise and the closure algorithm
Annals of Mathematics and Artificial Intelligence
PAC Analogues of Perceptron and Winnow via Boosting the Margin
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
MadaBoost: A Modification of AdaBoost
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Structural risk minimization over data-dependent hierarchies
IEEE Transactions on Information Theory
Can machine learning be secure?
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Multi-Class Learning by Smoothed Boosting
Machine Learning
Robust Loss Functions for Boosting
Neural Computation
Learning unions of ω(1)-dimensional rectangles
Theoretical Computer Science
Smooth Boosting for Margin-Based Ranking
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
The uniform hardcore lemma via approximate Bregman projections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Learning Halfspaces with Malicious Noise
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An evolutionary random search algorithm for double auction markets
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Learning Halfspaces with Malicious Noise
The Journal of Machine Learning Research
Edited AdaBoost by weighted kNN
Neurocomputing
Purifying data by machine learning with certainty levels
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Approximate reduction from AUC maximization to 1-norm soft margin optimization
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Learning DNF by statistical and proper distance queries under the uniform distribution
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
COLT'05 Proceedings of the 18th annual conference on Learning Theory
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
INFORMS Journal on Computing
A robust adaboost-based algorithm for low-resolution face detection
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Adversarial attacks against intrusion detection systems: Taxonomy, solutions and open issues
Information Sciences: an International Journal
Algorithms and hardness results for parallel large margin learning
The Journal of Machine Learning Research
Hi-index | 0.00 |
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm can be used to construct efficient PAC learning algorithms which tolerate relatively high rates of malicious noise. In particular, we use the new smooth boosting algorithm to construct malicious noise tolerant versions of the PAC-model p-norm linear threshold learning algorithms described by Servedio (2002). The bounds on sample complexity and malicious noise tolerance of these new PAC algorithms closely correspond to known bounds for the online p-norm algorithms of Grove, Littlestone and Schuurmans (1997) and Gentile and Littlestone (1999). As special cases of our new algorithms we obtain linear threshold learning algorithms which match the sample complexity and malicious noise tolerance of the online Perceptron and Winnow algorithms. Our analysis reveals an interesting connection between boosting and noise tolerance in the PAC setting.