Agnostic Boosting

This publication has 6 references indexed in Scilit:

• Hardness Results for Neural Network Approximation Problems
  Published by Springer Nature ,1999
• Theoretical Views of Boosting and Applications
  Published by Springer Nature ,1999
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
  IEEE Transactions on Information Theory, 1998
• A desicion-theoretic generalization of on-line learning and an application to boosting
  Published by Springer Nature ,1995
• Equivalence of models for polynomial learnability
  Information and Computation, 1991
• A theory of the learnable
  Communications of the ACM, 1984