Mind the Duality Gap: Logarithmic regret algorithms for online optimization
暂无分享,去创建一个
[1] Chuan Yi Tang,et al. A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..
[2] Dale Schuurmans,et al. General Convergence Results for Linear Discriminant Updates , 1997, COLT '97.
[3] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[4] Adrian S. Lewis,et al. Convex Analysis And Nonlinear Optimization , 2000 .
[5] Michael Collins,et al. Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms , 2002, EMNLP.
[6] Koby Crammer,et al. Online Passive-Aggressive Algorithms , 2003, J. Mach. Learn. Res..
[7] Marc Teboulle,et al. Mirror descent and nonlinear projected subgradient methods for convex optimization , 2003, Oper. Res. Lett..
[8] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[9] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[10] B. Schölkopf,et al. Convex Repeated Games and Fenchel Duality , 2007 .
[11] Y. Singer,et al. Logarithmic Regret Algorithms for Strongly Convex Repeated Games , 2007 .
[12] Yoram Singer,et al. A Unified Algorithmic Approach for Efficient Online Label Ranking , 2007, AISTATS.
[13] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.
[14] Peter L. Bartlett,et al. Adaptive Online Gradient Descent , 2007, NIPS.
[15] Shai Shalev-Shwartz,et al. Online learning: theory, algorithms and applications (למידה מקוונת.) , 2007 .
[16] P. Bartlett,et al. Optimal strategies and minimax lower bounds for online convex games [Technical Report No. UCB/EECS-2008-19] , 2008 .