Tracking a small set of experts by mixing past posteriors

Journal of Machine Learning Research

Volumn 3, Issue 3, 2003, Pages 363-396

  Bousquet, Olivier ^a   Warmuth, Manfred K ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b University of California Santa Cruz   (United States)

Author keywords

Loss bounds; On line learning; Share updates; Shifting experts

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); EXPERT SYSTEMS; ONLINE SYSTEMS;

ON-LINE LEARNING;

LEARNING SYSTEMS;

EID: 0041965987     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244303321897654     Document Type: Conference Paper

References (21)

1. P. Auer, N. Cesa-Bianchi, and C. Gentile. Adaptive and self-confident on-line learning algorithms. NeuroCOLT Technical Report NC-TR-00-083, 2000. An extended abstract appeared in Proc. 13th Ann. Conf. Computational Learning Theory.
2. P. Auer and M. K. Warmuth. Tracking the best disjunction. Journal of Machine Learning, 32(2):127-150, August 1998. Special issue on concept drift.
3. T. Bylander. The binary exponentiated gradient algorithm for learning linear functions. In Proc. of the 10th Annu. Conf. on Comput. Learning Theory, 184-192, ACM, 1997.
4. 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.
5. N. Cesa-Bianchi, D. P. Helmbold, and S. Panizza. On Bayes methods for on-line boolean prediction Algorithmica, 22(1/2):112-137, 1998.
6. Y. Freund. Private Communication, 2000. Also posted on http://www.learning-theory.org/.
7. M. R. Garey and D. J. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, 1979.
8. 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.
9. D. Helmbold, S. Panizza, M. K. Warmuth. Direct and indirect algorithms for on-line learning of disjunctions. In Paul Fischer and Hans Ulrich Simon, editors, Computational Learning Theory: 4th European Conference (EuroCOLT '99), Berlin, March 1999. Springer. To appear in Theoretical Computer Science.
10. M. Herbster. Private Communication, 1998.
11. M. Herbster and M. K. Warmuth. Tracking the best expert. Journal of Machine Learning, 32(2):151-178, August 1998. Special issue on concept drift.
12. M. Herbster and M. K. Warmuth. Tracking the best linear predictor. In Journal of Machine Learning Research, 1:281-309, 2001.
13. J. Kivinen and M. K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. In Journal of Information and Computation, 132(1):1-64, January 1997.
14. 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.
15. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
16. G. Shamir and N. Merhav. Low complexity sequential lossless coding for piecewise stationary memoryless sources. IEEE Trans. Info. Theory, 45:1498-1519, 1999.
17. Y. Singer. Switching portfolios. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI'98), pages 488-495, Morgan Kaufmann, San Francisco, CA, 1998.
18. V. Vovk. Aggregating strategies. In Proc. 3rd Annu. Workshop on Comput. Learning Theory, pages 371-383. Morgan Kaufmann, 1990.
19. V. Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56:153-173, 1998.
20. V. Vovk. Derandomizing stochastic prediction strategies. Machine Learning, 35(3):247-282, 1999.
21. F. M. J. Willems. Coding for a binary independent piecewise-identically-distributed source. IEEE Trans. Info. Theory, 42(6):2210-2217, 1996.