Optimal strategies from random walks

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 437-445

  Abernethy, Jacob ^a   Warmuth, Manfred K ^b   Yellin, Joel ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California Santa Cruz   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COUPON COLLECTORS; MIN-MAX STRATEGY; MULTIPLE SET; OPTIMAL STRATEGIES; RANDOM WALK; SEQUENTIAL GAMES; SIMPLE RANDOM WALK; TIME INTERVAL;

OPTIMIZATION; RANDOM PROCESSES;

OPTIMAL SYSTEMS;

EID: 84877747764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Abernethy, J. Langford, and M. K. Warmuth. Continuous experts and the Binning algorithm. In Proceedings of the 19th Annual Conference on Learning Theory (COLT06), pages 544-558. Springer, June 2007.
2. Nicolò Cesa-Bianchi, Yaov Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. J. ACM, 44(3): 427-485, 1997.
3. N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. K. Warmuth. Online prediction and conversion strategies. Machine Learning, 25: 71-110, 1996.
4. P. Erdos and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5A: 17-61, 1960.
5. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to Boosting. J. Comput. Syst. Sci., 55(1): 119-139, 1997. Special Issue for EuroCOLT '95.
6. D. Helmbold and M. K. Warmuth. Learning permutations with exponential weights. In Proceedings of the 20th Annual Conference on Learning Theory (COLT07). Springer, 2007.
7. Jyrki Kivinen and Manfred K. Warmuth. Averaging expert predictions. In Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999,
8. Proceedings, volume 1572 of Lecture Notes in Artificial Intelligence, pages 153-167. Springer, 1999.
9. N. Littlestone and M. K. Warmuth. The Weighted Majority algorithm. Inform. Comput., 108(2): 212-261, 1994. Preliminary version in in FOCS 89.
10. A. Myers and H. S. Wilf. Some new aspects of the Coupon-Collector's problem. SIAM J. Disc. Math., 17: 1-17, 2003.
11. D. Newman and L. Shepp. The Double Dixie Cup problem. Amer. Math Monthly., 67: 541-574, 1960.
12. V. Vovk. A game of prediction with expert advice. J. of Comput. Syst. Sci., 56(2): 153-173, 1998. Special Issue: Eighth Annual Conference on Computational Learning Theory.
13. M. K. Warmuth and D. Kuzmin. Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. In Advances in Neural Information Processing Systems 19 (NIPS 06). MIT Press, December 2006.