On learning multicategory classification with sample queries.

DOI10.1016/S0890-5401(03)00083-XzbMath1069.68094MaRDI QIDQ1427857

Joel Ratsaby

Publication date: 14 March 2004

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Pattern recognition; Multicategory classification; On-line learning algorithm; Stochastic gradient descent learning; Structural risk minimization

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Stochastic approximation methods for constrained and unconstrained systems
• Approximation and estimation bounds for artificial neural networks
• A decision-theoretic generalization of on-line learning and an application to boosting
• Adaptive model selection using empirical complexities
• Queries and concept learning
• Active learning using arbitrary binary valued queries
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
• Rademacher penalties and structural risk minimization
• Structural risk minimization over data-dependent hierarchies
• Concept learning using complexity regularization
• Learning by canonical smooth estimation. I. Simultaneous estimation
• Neural Network Learning
• Model selection and error estimation