Co-occurring keywords · papers mentioning both
Papers
Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions
NeurIPS 2012
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
COLT 2011
Accelerated Gradient Methods for Stochastic Optimization and Online Learning
NeurIPS 2009
Mind the Duality Gap: Logarithmic regret algorithms for online optimization
NeurIPS 2008
On the Generalization Ability of Online Strongly Convex Programming Algorithms
NeurIPS 2008