N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, M. Warmuth  Home/Search
Context Related
| ucsc.edu/pub/tr/ucsccrl9428.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~yoav/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of deterministically predicting boolean values by combining the boolean predictions... (Update)
Context of citations to this paper: More
.... and Warmuth s [44] WM (Weighted Majority) algorithm and later the BW (Binomial Weighting) algorithm by Cesa Bianchi et al. [18] address the question of consulting a finite number of experts that provide boolean advice. The prediction domain of either the manager or...
...scheme in the family, have been established in a variety of settings. Representative work and further references can be found in [41, 17, 27, 10, 9, 25]. Foster and Vohra [19] give an account of the aggregating problem and its history. Merhav and Feder [28] give an overview of...
Cited by: More
Merl A Mitsubishi Electric Research Laboratory - Http Www Merl (1996) (Correct)
Universal Prediction - Merhav, Feder (1998) (Correct)
Continuous Drifting Games - Freund, Opper (2000) (Correct)
Active bibliography (related documents): More All
0.6: On-line Learning with Malicious Noise and the Closure Algorithm - Auer, Cesa-Bianchi (1994) (Correct)
0.5: Counting Extensional Differences in BC-Learning - Jain, Stephan, Terwijn (Correct)
0.3: Bounds on Approximate Steepest Descent for Likelihood.. - Nicol Cesa-Bianchi.. (Correct)
Similar documents based on text: More All
0.3: Off-line On-line - Scenario Mistake-Bound Pac (Correct)
0.1: Relative Loss Bounds for Entropy Based Updates (Preliminary.. - Herbater (Correct)
0.1: Theory, 1998. [BB, p.90] A. Blum and C. Burch. On-line.. - Proc Th Annu (Correct)
Related documents from co-citation: More All
4: The weighted majority algorithm - Littlestone, Warmuth - 1994
4: How to use expert advice (context) - Cesa-Bianchi, Freund et al. - 1997
2: Ulam's Searching Game with a Fixed Number of Lies (context) - Spencer - 1992
BibTeX entry: (Update)
N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, and M. Warmuth. On-line prediction and conversion strategies. In EuroCOLT, pages 205--216. Clarendon Press, 1993. http://citeseer.ist.psu.edu/cesa-bianchi94line.html More
@inproceedings{ cesabianchi94line,
author = "Nicolo Cesa-Bianchi and Yoav Freund and David P. Helmbold and M. Warmuth",
title = "On-line Prediction and Conversion Strategies",
booktitle = "Computational Learning Theory: Eurocolt '93",
volume = "New Series Number 53",
publisher = "Oxford University Press",
address = "Oxford",
isbn = "0 19 853492 2",
pages = "205--216",
year = "1994",
url = "citeseer.ist.psu.edu/cesa-bianchi94line.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer et al. - 1992
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989
441 Queries and concept learning (context) - Angluin - 1988
317 Learning quickly when irrelevant attributes abound: a new li.. (context) - Littlestone - 1988
245 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
228 Simulated Annealing and Boltzmann Machines (context) - Aarts, Korst - 1989
118 How to use expert advice (context) - Cesa-Bianchi, Freund et al. - 1993
74 Mistake Bounds and Logarithmic Linear-threshold Learning Alg.. (context) - Littlestone - 1989
17 Searching in the presence of linearly bounded errors (context) - Aslam, Dhagat - 1991
17 Adventures of a Mathematician (context) - Ulam - 1977
15 Using experts for predicting continuous outcomes (context) - Kivinen, Warmuth - 1993
13 Ulam's searching game with a fixed number of lies (context) - Spencer - 1992
9 Simulating access to hidden information while learning - Auer, Long - 1994
8 Worst-case quadratic loss bounds for a generalization of the.. (context) - Cesa-Bianchi, Long et al. - 1993
4 An extended abstract appeared in: Proceedings of the 30th An.. (context) - Littlestone, Warmuth et al. - 1991
3 An extended abstract appeared in: Proceedings of the 23rd AC.. (context) - Littlestone, Long et al. - 1991
2 the prediction of general recursive functions (context) - Bardzin, Freivalds - 1972
1 Structural results about on-line learning models with and wi.. (context) - Auer, Long - 1994
1 Error-Correcting Codes (context) - Berlekamp - 1968
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~yoav/publications.html): More
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
Unsupervised Learning of Distributions on Binary Vectors.. - Freund, Haussler (1994) (Correct)
Boosting First-Order Learning - Quinlan (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC