Hannan consistency in on-line learning in case of unbounded losses under partial monitoring

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

Volumn 4264 LNAI, Issue , 2006, Pages 229-243

  Allenberg, Chamy ^a   Auer, Peter ^b   Györfi, László ^c   Ottucsák, György ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF LEOBEN   (Austria)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTANCE EDUCATION; ONLINE SYSTEMS; PROBABILITY; PROBLEM SOLVING;

HANNAN CONSISTENCY; ON-LINE LEARNING; PARTIAL MONITORING PROBLEMS;

LEARNING SYSTEMS;

EID: 33750733956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894841_20     Document Type: Conference Paper

References (16)

1. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: the adversial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, pages 322-331, Washington, DC, USA, Oct. 1995. IEEE Computer Society Press, Los Alamitos, CA.
2. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics, 6:1-8, 1956.
3. N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the ACM, 44(3)-.427-485, 1997.
4. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, Cambridge, 2006.
5. N. Cesa-Bianchi, G. Lugosi, and G. Stoltz. Minimizing regret with label efficient prediction. IEEE Trans. Inform. Theory, 11-51:2152-2162, June 2005.
6. N. Cesa-Bianchi, Y. Mansour, and G. Stoltz. Improved second-order bounds for prediction with expert advice. In COLT 2005, pages 217-232, 2005.
7. N. Cesa-Bianchi, Y. Mansour, and G. Stoltz. Improved second-order bounds for prediction with expert advice, 2006. (submitted).
8. Y. S. Chow. Local convergence of martingales and the law of large numbers. Annals of Mathematical Statistics, 36:552-558, 1965.
9. L. Györfi and G. Lugosi. Strategies for sequential prediction of stationary time series. In M. Dror, P. L'Ecuyer, and F. Szidarovszky, editors, Modelling Uncertainty: An Examination of its Theory, Methods and Applications, pages 225-248. Kluwer Academic Publishers, 2001.
10. L. Györfl and Gy. Ottucsák. Sequential prediction of unbounded stationary time series, 2006. (submitted).
11. A. György and Gy. Ottucsák. Adaptive routing using expert advice. The Computer Journal, 49(2):180-189, 2006.
12. J. Hannan. Approximation to bayes risk in repeated plays. In M. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume 3, pages 97-139. Princeton University Press, 1957.
13. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometria, 68(5):181-200, 2002.
14. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
15. J. Poland and M. Hutter. Defensive universal learning with experts. In Proc. 16th International Conf. on Algorithmic Learning Theory, ALT 2005, pages 356-370, Singapore, 2005. Springer, Berlin.
16. V. Vovk. Aggregating strategies. In Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 372-383, Rochester, NY, Aug. 1990. Morgan Kaufmann.