共 9 条
[2]
Logarithmic regret algorithms for online convex optimization
[J].
Machine Learning,
2007, 69
:169-192
[3]
A coordinate gradient descent method for nonsmooth separable minimization
[J].
Mathematical Programming,
2009, 117
:387-423
[9]
Making gradient descent optimal for strongly convex stochastic optimization .2 Rakhlin A,Shamir O,Sridharan K. Proc.of the29th Int’’l Conf.on Machine Learning(ICML 2012 ) . 2012