PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation
Abstract
Article Free Access Share on PAC-like upper bounds for the sample complexity of leave-one-out cross-validation Author: Sean B. Holden Department of Computer Science, University College London, Gower Street, London WC1E 6BT, United Kingdom Department of Computer Science, University College London, Gower Street, London WC1E 6BT, United KingdomSearch about this author Authors Info & Claims COLT '96: Proceedings of the ninth annual conference on Computational learning theoryJanuary 1996Pages 41–50https://doi.org/10.1145/238061.238067Published:01 January 1996Publication History 9citation527DownloadsMetricsTotal Citations9Total Downloads527Last 12 Months36Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cite
Text
Holden. "PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation." Annual Conference on Computational Learning Theory, 1996. doi:10.1145/238061.238067Markdown
[Holden. "PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation." Annual Conference on Computational Learning Theory, 1996.](https://mlanthology.org/colt/1996/holden1996colt-pac/) doi:10.1145/238061.238067BibTeX
@inproceedings{holden1996colt-pac,
title = {{PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation}},
author = {Holden, Sean B.},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1996},
pages = {41-50},
doi = {10.1145/238061.238067},
url = {https://mlanthology.org/colt/1996/holden1996colt-pac/}
}