Comment

DOI10.1214/088342306000000475zbMath1246.68178arXivmath/0612821OpenAlexW2155685018MaRDI QIDQ5965645

Jon D. McAuliffe, Michael I. Jordan, Bartlett, Peter L.

Publication date: 1 September 2012

Published in: Statistical Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612821

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• Convex analysis and nonlinear optimization. Theory and examples
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Support vector machines are universally consistent
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Improved boosting algorithms using confidence-rated predictions
• Kernel dimension reduction in regression
• Statistical performance of support vector machines
• Local Rademacher complexities
• 10.1162/153244303768966085
• Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Learning Theory
• Structural risk minimization over data-dependent hierarchies
• 10.1162/1532443041827925
• Convexity, Classification, and Risk Bounds