Tracking the best expert

Machine Learning

Volumn 32, Issue 2, 1998, Pages 151-178

  Herbster, Mark ^a   Warmuth, Manfred K ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Amortized analysis; Experts; Multiplicative updates; On line learning; Shifting

Indexed keywords

AMORTIZED ANALYSIS; MULTIPLICATIVE UPDATES; ON-LINE LEARNING; SHIFTING EXPERTS;

ALGORITHMS; DYNAMIC PROGRAMMING; FUNCTIONS; MATHEMATICAL MODELS; ONLINE SYSTEMS; SET THEORY; EXPERT SYSTEMS; LEARNING SYSTEMS; OPTIMIZATION;

LEARNING SYSTEMS; ALGORITHMS;

ONLINE ALGORITHMS; ONLINE LEARNING;

EID: 0032137328     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1023/A:1007424614876     Document Type: Conference Paper

References (20)

1. Auer, P. & Warmuth, M. K. (1998). Tracking the best disjunction. Machine Learning, this issue.
2. Blum, A. & Burch, C. (1997). On-line learning and the metrical task system. In Proceedings of the 10th Annual Workshop on Computational Learning Theory. ACM Press, New York, NY.
3. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM, 44(3), 427-485.
4. Cover, T. & Thomas, J. (1991). Elements of Information Theory. Wiley.
5. Feder, M., Merhav, N., & Gutman, M. (1992). Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38, 1258-1270.
6. Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences,55(1), 119-139.
7. Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997). Using and combining predictors that specialize. In Proceedings of the Twentyninth Annual ACM Symposium on Theory of Computing.
8. Haussler, D., Kivinen, J., & Warmuth, M. K. (1998). Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory. To appear.
9. Helmbold, D. P., Kivinen, J., & Warmuth, M. K. (1995). Worst-case loss bounds for sigmoided linear neurons. In Proceedings of the 1995 Neural Information Processing Conference, (pp. 309-315). MIT Press, Cambridge, MA.
10. Helmbold, D.P., Long, D.D.E., & Sherrod, B. (1996). A dynamic disk spin-down technique for mobile computing. In Proceedings of the Second Annual ACM International Conference on Mobile Computing and Networking. ACM/IEEE.
11. Herbster, M. (1997). Tracking the best expert II. Unpublished Manuscript.
12. Herbster, M. & Warmuth, M. K. (1995). Tracking the best expert. In Proceedings of the 12th International Conference on Machine Learning, (pp. 286-294). Morgan Kaufmann.
13. Kivinen, J. & Warmuth, M. K. (1997). Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1), 1-64.
14. Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
15. Littlestone, N. (1989). Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, Technical Report UCSC-CRL-89-11, University of California Santa Cruz.
16. Littlestone, N. & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212-261.
17. Singer, Y. (1997). Towards realistic and competitive portfolio selection algorithms. Unpublished Manuscript.
18. Vovk, V. (1998). A game of prediction with expert advice. Journal of Computer and System Sciences. To appear.
19. Vovk, V. (1997). Derandomizing stochastic prediction strategies. In Proceedings of the 10th Annual Workshop on Computational Learning Theory. ACM Press, New York, NY.
20. Warmuth, M. K. (1997). Predicting with the dot-product in the experts framework. Unpublished Manuscript.