Minimax regret of finite partial-monitoring games in stochastic environments

Journal of Machine Learning Research

Volumn 19, Issue , 2011, Pages 133-154

  Bartók, Gábor ^a   Pál, David ^a   Szepesvári, Csaba ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Imperfect feedback; Online learning; Regret analysis

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

COMPUTATIONALLY EFFICIENT; FEEDBACK SIGNAL; IMPERFECT FEEDBACK; MINIMAX REGRET; ONLINE LEARNING; REGRET ANALYSIS; STOCHASTIC ENVIRONMENT; TOTAL LOSS;

PROBABILITY DISTRIBUTIONS;

EID: 84867849262     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In Proceedings of the 21st Annual Conference on Learning Theory (COLT 2008), pages 263-273. Citeseer, 2008.
2. Alekh Agarwal, Peter Bartlett, and Max Dama. Optimal allocation strategies for the dark pool problem. In 13th International Conference on Artificial Intelligence and Statistics (AISTATS 2010), May 12-15, 2010, Chia Laguna Resort, Sardinia, Italy, 2010.
3. András Antos, Gábor Bartók, David Pál, and Csaba Szepesvári. Toward a classification of finite partial-monitoring games, 2011. http://arxiv.org/abs/1102.2041.
4. Jean-Yves Audibert and Sébastien Bubeck. Minimax policies for adversarial and stochastic bandits. In Proceedings of the 22nd Annual Conference on Learning Theory, 2009.
5. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
6. Gábor Bartók, David Pál, and Csaba Szepesvári. Toward a classification of finite partialmonitoring games. In Proceedings of the 21st international conference on Algorithmic Learning Theory (ALT 2010), pages 224-238. Springer, 2010.
7. Nicolò Cesa-Bianchi, Gábor Lugosi, and Gilles Stoltz. Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory, 51 (6):2152-2162, June 2005.
8. Nicoló Cesa-Bianchi, Gábor Lugosi, and Gilles Stoltz. Regret minimization under partial monitoring. Mathematics of Operations Research, 31(3):562-580, 2006.
9. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley, New York, second edition, 2006.
10. Abraham D. Flaxman, Adam Tauman Kalai, and H. Brendan McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proceedings of the 16th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), page 394. Society for Industrial and Applied Mathematics, 2005.
11. Robert Kleinberg and Tom Leighton. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science 2003 (FOCS 2003), pages 594-605. IEEE, 2003.
12. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
13. Gábor Lugosi and Nicolò Cesa-Bianchi. Prediction, Learning, and Games. Cambridge University Press, 2006.
14. V. Mnih. Efficient stopping rules. Master's thesis, Department of Computing Science, University of Alberta, 2008.
15. V. Mnih, Cs. Szepesvári, and J.-Y. Audibert. Empirical Bernstein stopping. In W. W. Cohen, A. McCallum, and S. T. Roweis, editors, ICML 2008, pages 672-679. ACM, 2008.
16. A. Pallavi, R. Zheng, and Cs. Szepesvári. Sequential learning for optimal monitoring of multi-channel wireless networks. In INFOCOMM, 2011.
17. Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial optimization: algorithms and complexity. Courier Dover Publications, New York, 1998.
18. Antonio Piccolboni and Christian Schindelhauer. Discrete prediction games with arbitrary feedback and loss. In Proceedings of the 14th Annual Conference on Computational Learning Theory (COLT 2001), pages 208-223. Springer-Verlag, 2001.
19. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of Twentieth International Conference on Machine Learning (ICML 2003), 2003.