Optimum follow the leader algorithm

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

Volumn 3559 LNAI, Issue , 2005, Pages 684-686

  Kuzmin, Dima ^a   Warmuth, Manfred K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944454409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_46     Document Type: Conference Paper

References (6)

1. [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.
2. [KV05] Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. J. Computer System Sci, 2005. To appear.
3. [LW94] N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
4. [TW03] E. Takimoto and M. K. Warmuth. Path kernels and multiplicative updates. Journal of Machine Learning Research, 4:773-818, October 2003.
5. [Val79] Leslie Valiant, The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8:410-421, 1979.
6. [Vbv97] V. Vovk. A game of prediction with expert advice. J. Computer System Sci, 1997.