Discrete prediction games with arbitrary feedback and loss

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

Volumn 2111, Issue , 2001, Pages 208-223

  Piccolboni, Antonio ^a   Schindelhauer, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORECASTING;

BEST CONSTANTS; FEEDBACK FUNCTIONS; ITERATED GAMES; LOSS FUNCTIONS; MULTI-ARMED BANDIT PROBLEM;

COMPUTATION THEORY;

EID: 84898041886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44581-1_14     Document Type: Conference Paper

References (17)

1. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 322–331. IEEE Computer SocietyPress, Los Alamitos, CA, 1995.
2. Peter Auer. Using upper confidence bounds for online learning. In Proceedings of the 41th Annual Symposium on Foundations of Computer Science, pages 270–279. IEEE Computer SocietyPress, Los Alamitos, CA, 2000.
3. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427–485, 1997.
4. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, and Manfred Warmuth. On-line prediction and conversion strategies. In EUROCOLT: EUROCOLT, European Conference on Computational Learning Theory, EuroCOLT,. LNCS, 1993.
5. Nicolò Cesa-Bianchi and Gabor Lugosi. Minimax regret under log loss for general classes of experts. In Proceedings of the 12th Annual Conference on Computational Learning Theory. ACM Press, 1999.
6. Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 1997. to appear.
7. James Hannan. Approximation to bayes risk in repeated play. In M. Dresher, A. W. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume 3, pages 97–139. Princeton UniversityPress, 1957.
8. D. Haussler, J. Kivinen, and M. K. Warmuth. Tight worst-case loss bounds for predicting with expert advice. Lecture Notes in Computer Science, 904:69, 1995.
9. D. Haussler, J. Kivinen, and M. K. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44, 1998.
10. Richard Karp, Elias Koutsopias, Christos Papadimitriou, and Scott Shenker. Optimization Problems in Congestion Control In Proceedings of the 41st Symposium on the Foundation of Computer Science, 2000.
11. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing,, 22(4):807–837, August 1993.
12. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212–261, 1 February 1994.
13. A. Piccolboni and C. Schindelhauer. Discrete prediction games with arbitraryfeedbac k and loss. Technical Report A-00-18, Schriftenreihe der Institute für Informatik und Mathematik, Universität Lübeck, October 2000.
14. Robert E. Schapire. Drifting games. In Proc. 12th Annu. Conf. on Comput. Learning Theory, pages 114–124. ACM Press, New York, NY, 1999.
15. V. Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56(2):153–173, April 1998.
16. V. Vovk. Competitive on-line statistics. In The 52nd Session of the International Statistical Institute, 1999.
17. T. Weissman and N. Merhav. Universal prediction of binaryindividual sequences in the presence of noise. accepted to IEEE Trans. Inform. Theory, September 2000.