Author:
Burgess Mark A.,Chapman Archie C.,Scott Paul
Publisher
Springer International Publishing
Reference31 articles.
1. Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: 23rd Annual Conference Learning Theory (COLT 2010) (2010)
2. Aggarwal, C.C.: Data Mining: The Textbook, chap. Outlier analysis, pp. 237–263. Springer, Cham (2015).
https://doi.org/10.1007/978-3-319-14142-8
3. Audibert, J.Y., Bubeck, S.: Minimax policies for adversarial and stochastic bandits. In: 22nd Annual Conference Learning Theory (COLT 2009) (2009)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);J-Y Audibert,2007
5. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The non-stochasticmulti-armed bandit problem. SIAM J. Comput. 31(1), 48–77 (2003)