Approximation stability and boosting

DOI10.1007/978-3-642-16108-7_9MaRDI QIDQ4930689zbMATH OpenOpenAlexFDO

Authors

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_9

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• STABILITY RESULTS IN LEARNING THEORY
• Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
• 10.1162/153244302760200704
• A survey on learning theory. I: Stability and generalization
• Stability of randomized learning algorithms

Cited in

(5)

• A stochastic approximation view of boosting
• Interpreting initial offset boosting via reconstitution in integral domain
• Quadratic boosting
• Approximation Stability and Proxy Objectives
• scientific article; zbMATH DE number 5251641 (Why is no real title available?)

This page was built for publication: Approximation stability and boosting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930689)