The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
PAC-Bayesian model averaging
Abstract
PAC-Bayesian learning methods combine the informative priors of Bayesian methods with distribution-free PAC guarantees. Building on earlier methods for PAC-Bayesian model selection, this paper presents a method for PAC-Bayesian model averaging. The main result is a bound on generalization error of an arbitrary weighted mixture of concepts that depends on the empirical error of that mixture and the KLdivergence of the mixture from the prior. A simple characterization is also given for the error bound achieved by the optimal weighting. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
McAllester, D. A. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279989 · Cited by 464
Self-citationBuntine, W. (1992) · Statistics and Computing · doi:10.1007/bf01889584 · Cited by 393
An experimental and theoretical comparison of model selection methods
Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225301 · Cited by 167
A PAC analysis of a Bayesian estimator
Shawe-Taylor, J., & Williamson, R. C. (1997) · Proceedings of the tenth annual conference on Computational learning theory - COLT '97 · doi:10.1145/267460.267466 · Cited by 167
Complexity Regularization with Application to Artificial Neural Networks
Barron, A. R. (1991) · Nonparametric Functional Estimation and Related Topics · doi:10.1007/978-94-011-3222-0_42 · Cited by 160
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
Kearns, M. J., & Mansour, Y. (1998) · Cited by 76
Predicting Nearly As Well As the Best Pruning of a Decision Tree
Helmbold, D. P., & Schapire, R. E. (1997) · Machine Learning · doi:10.1023/a:1007396710653 · Cited by 65
Concept learning using complexity regularization
Lugosi, G., & Zeger, K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481777 · Cited by 64
On Pruning and Averaging Decision Trees
Oliver, J., & Hand, D. J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50060-8 · Cited by 58
Cited by
(2015) · Cited by 2,857
A survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878
Sharpness-Aware Minimization for Efficiently Improving Generalization
Foret, P., Kleiner, A., Mobahi, H., & Neyshabur, B. (2020) · arXiv · doi:10.48550/arxiv.2010.01412 · Cited by 521
Theory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
Challenging the empirical mean and empirical variance: A deviation study
Catoni, O. (2012) · Annales de l'Institut Henri Poincaré, Probabilités et Statistiques · doi:10.1214/11-aihp454 · Cited by 298
Metadata
- Authors
- McAllester, D. A.
- Venue
- Proceedings of the twelfth annual conference on Computational learning theory
- Publisher
- ACM
- Published
- 1999-07-06
- Pages
- 164-170
- OpenAlex
- W2029029543
- Cited by
- 354
- References
- 10
- FWCI
- 3.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PAC-Bayesian model averaging. https://app.cochat.ai/papers/10.1145/307400.307435
- The paper
- McAllester, D. A. (1999). PAC-Bayesian model averaging. Proceedings of the twelfth annual conference on Computational learning theory. https://doi.org/10.1145/307400.307435
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.