Beyond Logarithmic Bounds in Online Learning
暂无分享,去创建一个
Claudio Gentile | Nicolò Cesa-Bianchi | Francesco Orabona | N. Cesa-Bianchi | C. Gentile | Francesco Orabona
[1] Ambuj Tewari,et al. Smoothness, Low Noise and Fast Rates , 2010, NIPS.
[2] Claudio Gentile,et al. A Second-Order Perceptron Algorithm , 2002, SIAM J. Comput..
[3] Ambuj Tewari,et al. Optimal Stragies and Minimax Lower Bounds for Online Convex Games , 2008, COLT.
[4] Elad Hazan,et al. On Stochastic and Worst-case Models for Investing , 2009, NIPS.
[5] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[6] V. Vovk. Competitive On‐line Statistics , 2001 .
[7] Koby Crammer,et al. Adaptive regularization of weight vectors , 2009, Machine Learning.
[8] Shai Shalev-Shwartz,et al. Online learning: theory, algorithms and applications (למידה מקוונת.) , 2007 .
[9] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.
[10] Manfred K. Warmuth,et al. Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.
[11] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[12] Thomas J. Walsh,et al. Knows what it knows: a framework for self-aware learning , 2008, ICML '08.
[13] Claudio Gentile,et al. Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms , 2004, NIPS.
[14] Francesco Orabona,et al. Better Algorithms for Selective Sampling , 2011, ICML.