1. [1] T. Fujita, K. Hatano, S. Kijima, and E. Takimoto, “Online linear optimization for job scheduling under precedence concstraints,” Proc. 26th International Conference on Algorithmic Learning Theory (ALT 2015), LNCS, vol.6331, pp.345-359, 2015.
2. [2] M.K. Warmuth and D. Kuzmin, “Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension,” J. Machine Learning Research, vol.9, pp.2287-2320, 2008.
3. [3] D.P. Helmbold and M.K. Warmuth, “Learning permutations with exponential weights,” J. Machine Learning Research, vol.10, pp.1705-1736, 2009. 10.1007/978-3-540-72927-3_34
4. [4] S. Yasutake, K. Hatano, S. Kijima, E. Takimoto, and M. Takeda, “Online linear optimization over permutations,” Proc. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), LNCS, vol.7074, pp.534-543, 2011. 10.1007/978-3-642-25591-5_55
5. [5] W.M. Koolen, M.K. Warmuth, and J. Kivinen, “Hedging structured concepts,” Proc. 23rd Conference on Learning Theory (COLT 2010), pp.93-105, 2010.