10.1162/153244303765208368

DOI10.1162/153244303765208368MaRDI QIDQ3044103zbMATH OpenOpenAlexFDO

Authors Ralf Herbrich, Robert C. Williamson

Publication date 10 August 2004

Published in CrossRef Listing of Deleted DOIs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/153244303765208368

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Structural risk minimization over data-dependent hierarchies
• New approaches to statistical learning theory
• 10.1162/153244302760200704
• On the importance of small coordinate projections
• On the Generalization Ability of On-Line Learning Algorithms

Cited in

(9)

• Indulgent algorithms (preliminary version)
• PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
• Why does deep and cheap learning work so well?
• PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
• Foundations of support constraint machines
• Exploiting Cluster-Structure to Predict the Labeling of a Graph
• On the importance of small coordinate projections
• On biased random walks, corrupted intervals, and learning under adversarial design
• Theory of Classification: a Survey of Some Recent Advances

This page was built for publication: 10.1162/153244303765208368

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