PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
From MaRDI portal
Publication:5921685
DOI10.1007/s10994-005-0462-7zbMath1469.68085MaRDI QIDQ5921685
Ralf Herbrich, John Shawe-Taylor, Thore Graepel
Publication date: 7 November 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-005-0462-7
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling by shortest data description
- Support-vector networks
- 10.1162/153244303765208368
- On the Generalization Ability of On-Line Learning Algorithms
- 10.1162/15324430152748236
- A PAC-Bayesian margin bound for linear classifiers
- Structural risk minimization over data-dependent hierarchies
- On the role of pattern matching in information theory
- 10.1162/153244302760200650
- Probability Inequalities for Sums of Bounded Random Variables
- Nearest neighbor pattern classification