Fetching the paper…
Reading the bibliography…
Nesterov's accelerated gradient methods (AGM) have been successfully applied in many machine learning areas.
Ergodic converence to a zero of the sum of monotone operators in Hilberts space
G. B. Passty · 1979
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence O O ( 1 / k 2 ) (1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
An algorithm for singly constrained class of quadratic programs subject to upper and lower bounds
P. M. Pardalos and N. Kovoor · 1990
Earlier work this paper cites.
Robust linear programming discrimination of two linearly inseparable sets
K. P. Bennett and O. L. Mangasarian · 1992
Earlier work this paper cites.
Convex Analysis and Minimization Algorithms, I and II , volume 305 and 306
J.B. Hiriart-Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
Efficient methods in convex programming
Arkadi Nemirovski · 1994
Earlier work this paper cites.
Nonlinear Programming
D. P. Bertsekas · 1995
Earlier work this paper cites.
Fast training of support vector machines using sequential minimal optimization
John C. Platt · 1999
Earlier work this paper cites.
Convex Analysis and Nonlinear Optimization: Theory and Examples
J. M. Borwein and A. S. Lewis · 2000
Earlier work this paper cites.
Conditional random fields: Probabilistic modeling for segmenting and labeling sequence data
J. D. Lafferty, A. McCallum, and F. Pereira · 2001
Earlier work this paper cites.
Introductory Lectures On Convex Optimization: A Basic Course
Yurii Nesterov · 2003
Earlier work this paper cites.
Interior gradient and epsilon-subgradient descent methods for constrained convex minimization
Alfred Auslender and Marc Teboulle · 2004
Earlier work this paper cites.
Max-margin Markov networks
B. Taskar, C. Guestrin, and D. Koller · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
Hui Zou and Trevor Hastie · 2005
Earlier work this paper cites.
A support vector method for multivariate performance measures
T. Joachims · 2005
Earlier work this paper cites.
Convexity, classification, and risk bounds
Peter L. Bartlett, Michael I. Jordan, and Jon D. McAuliffe · 2006
Cited alongside, same era.
Interior gradient and proximal methods for convex and conic optimization
Alfred Auslender and Marc Teboulle · 2006
Cited alongside, same era.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2007
Cited alongside, same era.
Online Learning: Theory, Algorithms, and Applications
Shai Shalev-Shwartz · 2007
Cited alongside, same era.
Training a support vector machine in the primal
Olivier Chapelle · 2007
Cited alongside, same era.
A heads-up no-limit texas hold’em poker player: Discretized betting models and automatically generated equilibrium-finding programs
Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre Sorensen · 2008
Cited alongside, same era.
Primal-dual first-order methods with 𝒪 ( 1 / ϵ ) \mathcal{O}(1/\epsilon) iteration complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato D. C. Monteiro · 2009
Later among the works it cites.
An accelerated gradient method for trace norm minimization
Shuiwang Ji and Jieping Ye · 2009
Later among the works it cites.
Proximal regularization for online and batch learning
C. Do, Q. Le, and C.S. Foo · 2009
Later among the works it cites.
Efficient euclidean projections in linear time
Jun Liu and Jieping Ye · 2009
Later among the works it cites.
Accelerated gradient methods for stochastic optimization and online learning
Chonghai Hu, James T. Kwok, and Weike Pan · 2009
Later among the works it cites.
Online learning for matrix factorization and sparse coding
Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Entropy regularized LPBoost
Manfred K. Warmuth, Karen A. Glocer, and S. V. N. Vishwanathan · 2008
Cited alongside, same era.
First-order methods for sparse covariance selection
Alexandre d’Aspremont, Onureena Banerjee, and Laurent El Ghaoui · 2008
Cited alongside, same era.
Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions
John Duchi, Shai Shalev-Shwartz, Yoram Singer, and Tushar Chandrae · 2008
Cited alongside, same era.
Smooth optimization approach for sparse covariance selection
Zhaosong Lu · 2009
Cited alongside, same era.
Large-scale sparse logistic regression
Jun Liu, Jianhui Chen, and Jieping Ye · 2009
Cited alongside, same era.
Lower bounds for BMRM and faster rates for training SVMs
Xinhua Zhang, Ankan Saha, and S.V.N. Vishwanathan · 2009
Cited alongside, same era.
Closest in time.
Implicit online learning
Brian Kulis and Peter L Bartlett · 2010
Closest in time.
Trace norm regularization: Reformulations, algorithms, and multi-task learning
Ting Kei Pong, Paul Tseng, Shuiwang Ji, and Jieping Ye · 2010
Closest in time.
Bundle methods for regularized risk minimization
Choon Hui Teo, S. V. N. Vishwanthan, Alex J. Smola, and Quoc V. Le · 2010
Closest in time.
Faster rates for training max-margin markov networks
Xinhua Zhang, Ankan Saha, and S.V.N. Vishwanathan · 2010
Closest in time.
NESVM: a fast gradient method for support vector machines
Tianyi Zhou, Dacheng Tao, and Xindong Wu · 2010
Closest in time.
Dual averaging methods for regularized stochastic learning and online optimization
Lin Xiao · 2010
Closest in time.
An optimal method for stochastic composite optimization
Guanghui Lan · 2010
Closest in time.
”optimal stochastic approximation algorithms for strongly convex stochastic composite optimization
Saeed Ghadimi and Guanghui Lan · 2010
Closest in time.
Lower bounds on rate of convergence of cutting plane methods
Xinhua Zhang, Ankan Saha, and S.V.N. Vishwanathan · 2011
Closest in time.