On-line learning and the Metrical Task System problem

Machine Learning

Volumn 39, Issue 1, 2000, Pages 35-58

  Blum, Avrim ^a   Burch, Carl ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; EXPERT SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

METRICAL TASK SYSTEMS (MTS);

LEARNING SYSTEMS;

EID: 0033904366     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007621832648     Document Type: Article

References (14)

1. Azar, Y., Broder, A., & Manasse, M. (1993). On-line choice of on-line algorithms. Proc ACM-SIAM Symposium on Discrete Algorithms (pp. 432-440).
2. Bartal, Y. (1996). Probabilistic approximations of metric spaces and its algorithmic applications. Proc IEEE Symposium on Foundations of Computer Science (pp. 183-193).
3. Bartal, Y., Blum, A., Burch, C., & Tomkins, A. (1997). A polylog(n)-competitive algorithm for metrical task systems. Proc ACM Symposium on Theory of Computing (pp. 711-719).
4. Blum, A., Karloff, H., Rabani, Y., & Saks, M. (1992). A decomposition theorem and lower bounds for randomized server problems. Proc IEEE Symposium on Foundations of Computer Science (pp. 197-207).
5. Borodin, A., Linial, N., & Saks, M. (1992). An optimal online algorithm for metrical task systems. J. of the ACM, 39(4), 745-763.
6. Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., & Warmuth, M. (1993). How to use expert advice. Proc ACM Symposium on Theory of Computing (pp. 382-391).
7. Chung, T. (1994). Approximate methods for sequential decision making using expert advice. Proc ACM Workshop on Computational Learning Theory (pp. 183-189). New York, NY: ACM Press.
8. Eskicioglu, M. (1990). Process migration in distributed systems: A comparitive survey. Tech. Rep. TR 90-3, University of Alberta.
9. Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., & Young, N. (1991). Competitive paging algorithms. J. of Algorithms, 12, 685-699.
10. Freund, Y. & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. Comp Syst Sci, 55(1), 119-139.
11. Herbster, M. & Warmuth, M. (1998). Tracking the best expert. Machine Learning, 32(2), 286-294.
12. Irani, S. & Seiden, S. (1998). Randomized algorithms for metrical task systems. Theoretical Computer Science, 194(1-2), 163-182.
13. Littlestone, N. & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212-261.
14. Seiden, S. (1999). Unfair problems and randomized algorithms for metrical task systems. Information and Computation, 148(2), 219-240.