Follow the Leader with Dropout Perturbations
暂无分享,去创建一个
[1] Jiazhong Nie,et al. Online PCA with Optimal Regrets , 2013, ALT.
[2] Wouter M. Koolen,et al. Adaptive Hedge , 2011, NIPS.
[3] Wouter M. Koolen,et al. Follow the leader if you can, hedge if you must , 2013, J. Mach. Learn. Res..
[4] Manfred K. Warmuth,et al. Optimum Follow the Leader Algorithm , 2005, COLT.
[5] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[6] Luc Devroye,et al. Prediction by random-walk perturbation , 2013, COLT.
[7] Shai Shalev-Shwartz,et al. Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..
[8] Nitish Srivastava,et al. Improving neural networks by preventing co-adaptation of feature detectors , 2012, ArXiv.
[9] David Haussler,et al. How to use expert advice , 1993, STOC.
[10] Manfred K. Warmuth,et al. Repeated Games against Budgeted Adversaries , 2010, NIPS.
[11] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[12] Sida I. Wang,et al. Dropout Training as Adaptive Regularization , 2013, NIPS.
[13] Claudio Gentile,et al. Adaptive and Self-Confident On-Line Learning Algorithms , 2000, J. Comput. Syst. Sci..
[14] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[15] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..
[16] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[17] Manfred K. Warmuth,et al. Additive versus exponentiated gradient updates for linear prediction , 1995, STOC '95.
[18] Manfred K. Warmuth,et al. Online variance minimization , 2011, Machine Learning.
[19] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).
[20] Philip M. Long,et al. WORST-CASE QUADRATIC LOSS BOUNDS FOR ON-LINE PREDICTION OF LINEAR FUNCTIONS BY GRADIENT DESCENT , 1993 .
[21] Christopher D. Manning,et al. Fast dropout training , 2013, ICML.
[22] Manfred K. Warmuth,et al. On-line Variance Minimization in O(n2) per Trial? , 2010, COLT.
[23] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.