Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction
暂无分享,去创建一个
[1] Jacob D. Abernethy,et al. An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction? , 2009, COLT.
[2] Thomas P. Hayes,et al. The Price of Bandit Information for Online Optimization , 2007, NIPS.
[3] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[4] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.
[5] P. Bartlett,et al. Closing the gap between bandit and full-information online optimization : high-probability regret bound , 2007 .
[6] Baruch Awerbuch,et al. Online linear optimization and adaptive routing , 2008, J. Comput. Syst. Sci..
[7] J. Abernethy,et al. An Efficient Bandit Algorithm for √ T-Regret in Online Multiclass Prediction ? , 2009 .
[8] Thomas P. Hayes,et al. Robbing the bandit: less regret in online geometric optimization against an adaptive adversary , 2006, SODA '06.
[9] Elad Hazan,et al. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.
[10] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[11] Ambuj Tewari,et al. Efficient bandit algorithms for online multiclass prediction , 2008, ICML '08.
[12] Koby Crammer,et al. Multiclass classification with bandit feedback using adaptive regularization , 2012, Machine Learning.
[13] John Langford,et al. The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information , 2007, NIPS.
[14] Avrim Blum,et al. Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary , 2004, COLT.
[15] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.