Open Problem: Shifting Experts on Easy Data
暂无分享,去创建一个
[1] Wouter M. Koolen,et al. Putting Bayes to sleep , 2012, NIPS.
[2] Marcus Hutter,et al. Adaptive Online Prediction by Following the Perturbed Leader , 2005, J. Mach. Learn. Res..
[3] Mark Herbster,et al. Tracking the Best Linear Predictor , 2001, J. Mach. Learn. Res..
[4] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[5] Wouter M. Koolen,et al. Follow the leader if you can, hedge if you must , 2013, J. Mach. Learn. Res..
[6] Wojciech Kotlowski,et al. Follow the Leader with Dropout Perturbations , 2014, COLT.
[7] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.
[8] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[9] Manfred K. Warmuth,et al. Repeated Games against Budgeted Adversaries , 2010, NIPS.
[10] Manfred K. Warmuth,et al. Tracking a Small Set of Experts by Mixing Past Posteriors , 2003, J. Mach. Learn. Res..
[11] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[12] Nicolò Cesa-Bianchi,et al. Mirror Descent Meets Fixed Share (and feels no regret) , 2012, NIPS.
[13] Wouter M. Koolen,et al. Adaptive Hedge , 2011, NIPS.
[14] Aleksandrs Slivkins,et al. 25th Annual Conference on Learning Theory The Best of Both Worlds: Stochastic and Adversarial Bandits , 2022 .
[15] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..