Fetching the paper…
Reading the bibliography…
Online prediction methods are typically presented as serial algorithms running on a single processor.
On the interchange of subdifferentiation and conditional expectation for convex functionals
R. T. Rockafellar and R. J-B Wets · 1982
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans · 1986
Earlier work this paper cites.
Introduction to Optimization
B. T. Polyak · 1987
Earlier work this paper cites.
Reevaluating Amdahl’s Law
J. L. Gustafson · 1988
Earlier work this paper cites.
Parallel and Distributed Computation: Numerical Methods
D. P. Bertsekas and J. N. Tsitsiklis · 1989
Earlier work this paper cites.
Stochastic programming
R. J-B Wets · 1989
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
G. Chen and M. Teboulle · 1993
Earlier work this paper cites.
Introduction to Stochastic Programming
J. R. Birge and F. Louveaux · 1997
Earlier work this paper cites.
Distributed asynchronous incremental subgradient methods
A. Nedić, D. P. Bertsekas, and V. S. Borkar · 2001
Earlier work this paper cites.
Online bayes point machines
E. Harrington, R. Herbrich, J. Kivinen, J. Platt, and R. C. Williamson · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yu. Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of nonsmooth functions
Yu. Nesterov · 2005
Cited alongside, same era.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Pegasos: Primal estimated sub-gradient solver for SVM
S. Shalev-Shwartz, Y. Singer, and N. Srebro · 2007
Cited alongside, same era.
Local strong convexity and local Lipschitz continuity of the gradient of convex functions
R. Goebel and R. T. Rockafellar · 2008
Cited alongside, same era.
Confidence level solutions for stochastic programming
Yu. Nesterov and J.-Ph. Vial · 2008
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Later among the works it cites.
Primal-dual subgradient methods for convex problems
Yu. Nesterov · 2009
Later among the works it cites.
Distributed dual averaging in networks
J. Duchi, A. Agarwal, and M. Wainwright · 2010
Closest in time.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization
S. Ghadimi and G. Lan · 2010
Closest in time.
Distributed asynchronous online learning for natural language processing
K. Gimpel, D. Das, and N. A. Smith · 2010
Closest in time.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A stochastic view of optimal regret through minimax duality
J. Abernethy, A. Agarwal, A. Rakhlin, and P. L. Bartlett · 2009
Cited alongside, same era.
Efficient online and batch learning using forward backward splitting
J. Duchi and Y. Singer · 2009
Cited alongside, same era.
Accelerated gradient methods for stochastic optimization and online learning
C. Hu, J. T. Kwok, and W. Pan · 2009
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2009
Cited alongside, same era.
Slow learners are fast
J. Langford, A. J. Smola, and M. Zinkevich · 2009
Cited alongside, same era.
Distributed subgradient methods for multi-agent optimization
A. Nedić and A. Ozdaglar · 2009
Cited alongside, same era.
Parallelized stochastic gradient descent
M. Zinkevich, M. Weimer, A. Smola, and L. Li · 2010
Closest in time.
Better mini-batch algorithms via accelerated gradient methods
A. Cotter, O. Shamir, N. Srebro, and K. Sridharan · 2011
Closest in time.
Optimal distributed online prediction
O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao · 2011
Closest in time.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Closest in time.
Primal-dual first-order methods with O ( 1 / ϵ ) O(1/\epsilon) iteration-complexity for cone programming
G. Lan, Z. Lu, and R. D. C. Monteiro · 2011
Closest in time.
Stochastic methods for ℓ 1 \ell_{1} -regularized loss minimization
S. Shalev-Shwartz and A. Tewari · 2011
Closest in time.