Continuous experts and the binning algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 544-558

  Abernethy, Jacob ^a   Langford, John ^a   Warmuth, Manfred K ^b,c  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NSF Grant CCR CCR 9821087   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; EXPERT SYSTEMS; LEARNING SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

BINARY PREDICTIONS; BINOMIAL WEIGHTING ALGORITHM; MASTER ALGORITHMS;

ALGORITHMS;

EID: 33746052849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_40     Document Type: Conference Paper

References (12)

1. [ACBFS95] Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 322-331. IEEE Computer Society Press, Los Alamitos, CA, 1995.
2. [CBFH+97] N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427-485, 1997.
3. [CBFHW96] Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, and Manfred K. Warmuth. On-line prediction and conversion strategies. Machine Learning, 25:71-110, 1996.
4. [FO02] Y. Freund and M. Opper. Drifting games and Brownian motion. Journal of Computer and System Sciences, 64:113-132, 2002.
5. [Fre95] Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, September 1995.
6. [FS97] Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, August 1997.
7. [HKW98] D. Haussler, J. Kivinen, and M. K. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44(2)-.1906-1925, September 1998.
8. [HW98] M. Herbster and M. K. Warmuth. Tracking the best expert. Journal of Machine Learning, 32(2):151-178, August 1998.
9. [KW97] J. Kivinen and M. K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1):1-64, January 1997.
10. [KW99] J. Kivinen and M. K. Warmuth. Averaging expert predictions. In Paul Fischer and Hans Ulrich. Simon, editors, Computational Learning Theory: 4th European Conference (EuroCOLT '99), pages 153-167, Berlin, March 1999. Springer.
11. [LW94] N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994. An early version appeared in FOCS 89.
12. [Vov90] V. Vovk. Aggregating strategies. In Proc. 3rd Annu. Workshop on Comput. Learning Theory, pages 371-383. Morgan Kaufmann, 1990.