Fetching the paper…
Reading the bibliography…
Statistical preconditioning enables fast methods for distributed large-scale empirical risk minimization problems.
Rcv1: A new benchmark collection for text categorization research
D. D. Lewis, Y. Yang, T. G. Rose, and F. Li · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Y. Nesterov · 2007
Earlier work this paper cites.
Mapreduce: simplified data processing on large clusters
J. Dean and S. Ghemawat · 2008
Earlier work this paper cites.
Estimate sequence methods: extensions and approximations
M. Baes · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Introduction to algorithms
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein · 2009
Earlier work this paper cites.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
R. D. Monteiro and B. F. Svaiter · 2013
Earlier work this paper cites.
Trading computation for communication: Distributed stochastic dual coordinate ascent
T. Yang · 2013
Earlier work this paper cites.
First-order methods of smooth convex optimization with inexact oracle
O. Devolder, F. Glineur, and Y. Nesterov · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2014
Earlier work this paper cites.
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
Q. Lin and L. Xiao · 2014
Earlier work this paper cites.
Communication-efficient distributed optimization using an approximate newton-type method
O. Shamir, N. Srebro, and T. Zhang · 2014
Earlier work this paper cites.
Communication-efficient distributed optimization using an approximate newton-type method
O. Shamir, N. Srebro, and T. Zhang · 2014
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Y. Arjevani and O. Shamir · 2015
Earlier work this paper cites.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Earlier work this paper cites.
Disco: Distributed optimization for self-concordant empirical loss
Y. Zhang and X. Lin · 2015
Earlier work this paper cites.
A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications
H. H. Bauschke, J. Bolte, and M. Teboulle · 2016
Earlier work this paper cites.
Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
P. Dvurechensky and A. Gasnikov · 2016
Earlier work this paper cites.
Strassen’s algorithm reloaded
J. Huang, T. M. Smith, G. M. Henry, and R. A. van de Geijn · 2016
Earlier work this paper cites.
Aide: Fast and communication efficient distributed optimization
S. J. Reddi, J. Konečnỳ, P. Richtárik, B. Póczós, and A. Smola · 2016
Earlier work this paper cites.
Sdca without duality, regularization, and individual convexity
S. Shalev-Shwartz · 2016
Cited alongside, same era.
A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications
H. H. Bauschke, J. Bolte, and M. Teboulle · 2017
Cited alongside, same era.
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
E. G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, and P. L. Toint · 2017
Cited alongside, same era.
A. Gasnikov · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié · 2017
Cited alongside, same era.
Lower bounds for finding stationary points i
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford · 2020
Later among the works it cites.
Contracting proximal methods for smooth convex optimization
N. Doikov and Y. Nesterov · 2020
Later among the works it cites.
Inexact tensor methods with dynamic accuracies
N. Doikov and Y. Nesterov · 2020
Later among the works it cites.
Statistically preconditioned accelerated gradient method for distributed optimization
H. Hendrikx, L. Xiao, S. Bubeck, F. Bach, and L. Massoulie · 2020
Later among the works it cites.
Near-optimal hyperfast second-order method for convex optimization
D. Kamzolov · 2020
Later among the works it cites.
Near-optimal hyperfast second-order method for convex optimization and its sliding
D. Kamzolov and A. Gasnikov · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Decentralize and randomize: Faster algorithm for Wasserstein barycenters
P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C. A. Uribe, and A. Nedić · 2018
Cited alongside, same era.
Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
P. Dvurechensky, A. Gasnikov, and A. Kroshnin · 2018
Cited alongside, same era.
Universal method for stochastic composite optimization problems
A. V. Gasnikov and Y. E. Nesterov · 2018
Cited alongside, same era.
Communication-efficient algorithms for decentralized and stochastic optimization
G. Lan, S. Lee, and Y. Zhou · 2018
Cited alongside, same era.
Relatively smooth convex optimization by first-order methods, and applications
H. Lu, R. M. Freund, and Y. Nesterov · 2018
Cited alongside, same era.
Lectures on Convex Optimization
Y. Nesterov · 2018
Cited alongside, same era.
Lectures on convex optimization
Y. Nesterov et al · 2018
Cited alongside, same era.
Later among the works it cites.
Optimal combination of tensor optimization methods
D. Kamzolov, A. Gasnikov, and P. Dvurechensky · 2020
Later among the works it cites.
First-order and Stochastic Optimization Methods for Machine Learning
G. Lan · 2020
Later among the works it cites.
Inexact basic tensor methods for some classes of convex optimization problems
Y. Nesterov · 2020
Later among the works it cites.
1.5.0, 2020
Pytorch · 2020
Later among the works it cites.
On convergence of distributed approximate newton methods: Globalization, sharper bounds and beyond
X.-T. Yuan and P. Li · 2020
Later among the works it cites.
First-order methods for convex optimization
P. Dvurechensky, S. Shtern, and M. Staudigl · 2021
Closest in time.
Accelerated bregman proximal gradient methods for relatively smooth convex optimization
F. Hanzely, P. Richtárik, and L. Xiao · 2021
Closest in time.
An optimal algorithm for decentralized finite-sum optimization
H. Hendrikx, F. Bach, and L. Massoulié · 2021
Closest in time.
Inexact high-order proximal-point methods with auxiliary search procedure
Y. Nesterov · 2021
Closest in time.
Superfast second-order methods for unconstrained convex optimization
Y. Nesterov · 2021
Closest in time.
Inexact model: a framework for optimization and variational inequalities
F. Stonyakin, A. Tyurin, A. Gasnikov, P. Dvurechensky, A. Agafonov, D. Dvinskikh, M. Alkousa, D. Pasechnyuk, S. Artamonov, and V. Piskunova · 2021
Closest in time.
Optimal complexity and certification of bregman first-order methods
R.-A. Dragomir, A. Taylor, A. d’Aspremont, and J. Bolte · 2022
Closest in time.
Exact gradient methods with memory
M. I. Florea · 2022
Closest in time.
Distributed optimization based on gradient tracking revisited: Enhancing convergence rate via surrogation
Y. Sun, G. Scutari, and A. Daneshmand · 2022
Closest in time.