Improved second-order bounds for prediction with expert advice

[1]  Nicolò Cesa-Bianchi,et al.  Regret Minimization Under Partial Monitoring , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[2]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[3]  Gábor Lugosi,et al.  Minimizing regret with label efficient prediction , 2004, IEEE Transactions on Information Theory.

[4]  Chamy Allenberg-Neeman,et al.  Full Information Game with Gains and Losses , 2004, ALT.

[5]  Claudio Gentile,et al.  Adaptive and Self-Confident On-Line Learning Algorithms , 2000, J. Comput. Syst. Sci..

[6]  Peter Auer,et al.  The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[7]  Christian Schindelhauer,et al.  Discrete Prediction Games with Arbitrary Feedback and Loss , 2001, COLT/EuroCOLT.

[8]  J. Shawe-Taylor.  Potential-Based Algorithms in On-Line Prediction and Game Theory ∗ , 2001 .

[9]  S. Hart,et al.  A Reinforcement Procedure Leading to Correlated Equilibrium , 2001 .

[10]  Manfred K. Warmuth,et al.  How to use expert advice , 1997, JACM.

[11]  Yoram Singer,et al.  On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.

[12]  Erik Ordentlich,et al.  On-line portfolio selection , 1996, COLT '96.

[13]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[14]  Vladimir Vovk,et al.  A game of prediction with expert advice , 1995, COLT '95.

[15]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  D. Freedman.  On Tail Probabilities for Martingales , 1975 .