1. Abernethy, J., Hazan, E., & Rakhlin, A. (2008). Competing in the dark: an efficient algorithm for bandit linear optimization. In Proceedings of the 21st annual conference on learning theory (pp. 263–274).
2. Agarwal, A., Hazan, E., Kale, S., & Schapire, R. E. (2006). Algorithms for portfolio management based on the Newton method. In Proceedings of the 23rd international conference on machine learning (pp. 9–16).
3. Agarwal, A., Dekel, O., & Xiao, L. (2010). Optimal algorithms for online convex optimization with multi-point bandit feedback. In Proceedings of the 23rd annual conference on learning theory (pp. 28–40).
4. Awerbuch, B., & Kleinberg, R. D. (2004). Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In Proceedings of the 36th ACM symposium on theory of computing (pp. 45–53).
5. Bianchi, N. C., Mansour, Y., & Stoltz, G. (2005). Improved second-order bounds for prediction with expert advice. In Proceedings of the 18th annual conference on learning theory (Vol. 3559, pp. 217–232).