Predicting a Binary Sequence Almost as Well as the Optimal Biased Coin
Abstract
Article Free Access Share on Predicting a binary sequence almost as well as the optimal biased coin Author: Yoav Freund AT&T Laboratories AT&T LaboratoriesView Profile Authors Info & Claims COLT '96: Proceedings of the ninth annual conference on Computational learning theoryJanuary 1996 Pages 89–98https://doi.org/10.1145/238061.238072Online:01 January 1996Publication History 32citation359DownloadsMetricsTotal Citations32Total Downloads359Last 12 Months20Last 6 weeks2 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
Freund. "Predicting a Binary Sequence Almost as Well as the Optimal Biased Coin." Annual Conference on Computational Learning Theory, 1996. doi:10.1145/238061.238072Markdown
[Freund. "Predicting a Binary Sequence Almost as Well as the Optimal Biased Coin." Annual Conference on Computational Learning Theory, 1996.](https://mlanthology.org/colt/1996/freund1996colt-predicting/) doi:10.1145/238061.238072BibTeX
@inproceedings{freund1996colt-predicting,
title = {{Predicting a Binary Sequence Almost as Well as the Optimal Biased Coin}},
author = {Freund, Yoav},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1996},
pages = {89-98},
doi = {10.1145/238061.238072},
url = {https://mlanthology.org/colt/1996/freund1996colt-predicting/}
}