1. Jacob Abernethy, Peter Bartlett, Alexander Rakhlin, and Ambuj Tewari. 2008. Optimal stragies and minimax lower bounds for online convex games. University of California, Berkeley, United States.
2. Alekh Agarwal, Ofer Dekel, and Lin Xiao. 2010. Optimal algorithms for online convex optimization with multi-point bandit feedback. In The 23rd Conference on Learning Theory. Omnipress, 28--40.
3. Terry Anderson. 2008. The theory and practice of online learning. athabasca university press.