Author:
Blum Avrim,Mansour Yishay
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Auer, P., Cesa-Bianchi, N., Gentile, C.: Adaptive and self-confident on-line learning algorithms. JCSS 64(1), 48–75 (2002); A preliminary version has appeared. In: Proc. 13th Ann. Conf. Computational Learning Theory
2. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32(1), 48–77 (2002)
3. Aumann, R.J.: Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics 1, 67–96 (1974)
4. Blackwell, D.: An analog ofthe mimimax theorem for vector payoffs. Pacific Journal of Mathematics 6, 1–8 (1956)
5. Blum, A.: Empirical support for winnow and weighted-majority based algorithms: results on a calendar scheduling domain. Machine Learning 26, 5–23 (1997)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献