Microchoice Bounds and Self Bounding Learning Algorithms
Abstract
Article Microchoice bounds and self bounding learning algorithms Share on Authors: John Langford Computer Science Department, Carnegie Mellon University, Pittsburgh, PA Computer Science Department, Carnegie Mellon University, Pittsburgh, PAView Profile , Avrim Blum Computer Science Department, Carnegie Mellon University, Pittsburgh, PA Computer Science Department, Carnegie Mellon University, Pittsburgh, PAView Profile Authors Info & Claims COLT '99: Proceedings of the twelfth annual conference on Computational learning theoryJuly 1999 Pages 209–214https://doi.org/10.1145/307400.307441Online:06 July 1999Publication History 6citation179DownloadsMetricsTotal Citations6Total Downloads179Last 12 Months1Last 6 weeks0 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 SiteGet Access
Cite
Text
Langford and Blum. "Microchoice Bounds and Self Bounding Learning Algorithms." Annual Conference on Computational Learning Theory, 1999. doi:10.1145/307400.307441Markdown
[Langford and Blum. "Microchoice Bounds and Self Bounding Learning Algorithms." Annual Conference on Computational Learning Theory, 1999.](https://mlanthology.org/colt/1999/langford1999colt-microchoice/) doi:10.1145/307400.307441BibTeX
@inproceedings{langford1999colt-microchoice,
title = {{Microchoice Bounds and Self Bounding Learning Algorithms}},
author = {Langford, John and Blum, Avrim},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1999},
pages = {209-214},
doi = {10.1145/307400.307441},
url = {https://mlanthology.org/colt/1999/langford1999colt-microchoice/}
}