Fetching the paper…
Reading the bibliography…
We consider stochastic convex optimization problems with affine constraints and develop several methods using either primal or dual approach to solve it.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Decomposition into functions in the minimization problem
VM Kibardin · 1979
Earlier work this paper cites.
Parallel and distributed computation: numerical methods
Dimitri P Bertsekas and John N Tsitsiklis · 1989
Earlier work this paper cites.
Lectures on Modern Convex Optimization
Aaron Ben-Tal and Arkadi Nemirovski · 2001
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Yurii Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Yurii Nesterov · 2005
Earlier work this paper cites.
Large deviations of vector-valued martingales in 2-smooth normed spaces
Anatoli Juditsky and Arkadii S Nemirovski · 2008
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Guanghui Lan · 2008
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Stochastic convex optimization
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan · 2009
Earlier work this paper cites.
Lectures on Stochastic Programming
A. Shapiro, D. Dentcheva, and A. Ruszczyński · 2009
Earlier work this paper cites.
Double smoothing technique for large-scale linearly constrained convex optimization
Olivier Devolder, François Glineur, and Yurii Nesterov · 2012
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework
S. Ghadimi and G. Lan · 2012
Earlier work this paper cites.
First order methods for non-smooth convex large-scale optimization, i: General purpose methods
A. Juditsky and A. Nemirovski · 2012
Earlier work this paper cites.
How to make the gradients small
Yurii Nesterov · 2012
Earlier work this paper cites.
Parametric estimation. finite sample theory
Vladimir Spokoiny et al · 2012
Earlier work this paper cites.
Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization
Olivier Devolder · 2013
Earlier work this paper cites.
First-order methods with inexact oracle: the strongly convex case
Olivier Devolder, François Glineur, Yurii Nesterov, et al · 2013
Earlier work this paper cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Earlier work this paper cites.
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
Anatoli Juditsky and Yuri Nesterov · 2014
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Earlier work this paper cites.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2014
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Earlier work this paper cites.
Convex analysis
Ralph Tyrell Rockafellar · 2015
Earlier work this paper cites.
Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
Alexey Chernov, Pavel Dvurechensky, and Alexander Gasnikov · 2016
Earlier work this paper cites.
A smoothed dual approach for variational wasserstein problems
Marco Cuturi and Gabriel Peyré · 2016
Earlier work this paper cites.
Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
Pavel Dvurechensky and Alexander Gasnikov · 2016
Earlier work this paper cites.
A. V. Gasnikov, A. A. Lagunovskaya, I. N. Usmanova, and F. A. Fedorenko · 2016
Cited alongside, same era.
Universal fast gradient method for stochastic composit optimization problems
Alexander Gasnikov and Yurii Nesterov · 2016
Cited alongside, same era.
Gradient sliding for composite optimization
Guanghui Lan · 2016
Cited alongside, same era.
Algorithms for stochastic optimization with expectation constraints
Guanghui Lan and Zhiqiang Zhou · 2016
Cited alongside, same era.
QSGD: Communication-efficient SGD via gradient quantization and encoding
Dan Alistarh, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnovic · 2017
Cited alongside, same era.
On dual approach for distributed stochastic convex optimization over networks
Darina Dvinskikh, Eduard Gorbunov, Alexander Gasnikov, Pavel Dvurechensky, and Cesar A Uribe · 2019
Closest in time.
Robust distributed accelerated stochastic gradient methods for multi-agent networks
Alireza Fallah, Mert Gurbuzbalaban, Asu Ozdaglar, Umut Simsekli, and Lingjiong Zhu · 2019
Closest in time.
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate
Vitaly Feldman and Jan Vondrak · 2019
Closest in time.
The complexity of making the gradient small in stochastic convex optimization
Dylan Foster, Ayush Sekhari, Ohad Shamir, Nathan Srebro, Karthik Sridharan, and Blake Woodworth · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
A. S. Anikin, A. V. Gasnikov, P. E. Dvurechensky, A. I. Tyurin, and A. V. Chernov · 2017
Cited alongside, same era.
Pavel Dvurechensky, Alexander Gasnikov, and Alexander Tiurin · 2017
Cited alongside, same era.
Alexander Gasnikov · 2017
Cited alongside, same era.
Communication-efficient algorithms for decentralized and stochastic optimization
Guanghui Lan, Soomin Lee, and Yi Zhou · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2017
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Cited alongside, same era.
Eduard Gorbunov, Filip Hanzely, and Peter Richtárik · 2019
Closest in time.
Sgd: General analysis and improved rates
Robert Mansel Gower, Nicolas Loizou, Xun Qian, Alibek Sailanbayev, Egor Shulgin, and Peter Richtarik · 2019
Closest in time.
Accelerated alternating minimization
Sergey Guminov, Pavel Dvurechensky, and Alexander Gasnikov · 2019
Closest in time.
Natural compression for distributed deep learning
Samuel Horvath, Chen-Yu Ho, Ludovit Horvath, Atal Narayan Sahu, Marco Canini, and Peter Richtarik · 2019
Closest in time.
Stochastic distributed learning with gradient quantization and variance reduction
Samuel Horváth, Dmitry Kovalev, Konstantin Mishchenko, Sebastian Stich, and Peter Richtárik · 2019
Closest in time.
A short note on concentration inequalities for random vectors with subgaussian norm
Chi Jin, Praneeth Netrapalli, Rong Ge, Sham M Kakade, and Michael I Jordan · 2019
Closest in time.
Error feedback fixes signsgd and other gradient compression schemes
Sai Praneeth Karimireddy, Quentin Rebjock, Sebastian U Stich, and Martin Jaggi · 2019
Closest in time.
Better communication complexity for local sgd
Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik · 2019
Closest in time.
First analysis of local gd on heterogeneous data
Ahmed Khaled, Konstantin Mishchenko, and Peter Richtárik · 2019
Closest in time.
On the complexity of approximating wasserstein barycenter
Alexey Kroshnin, Darina Dvinskikh, Pavel Dvurechensky, Alexander Gasnikov, Nazarii Tupitsa, and Cesar Uribe · 2019
Closest in time.
Andrei Kulunchakov and Julien Mairal · 2019
Closest in time.
Estimate sequences for variance-reduced stochastic composite optimization
Andrei Kulunchakov and Julien Mairal · 2019
Closest in time.
A generic acceleration framework for stochastic composite optimization
Andrei Kulunchakov and Julien Mairal · 2019
Closest in time.
Lectures on optimization methods for machine learning
George Lan · 2019
Closest in time.
A double residual compression algorithm for efficient distributed learning
Xiaorui Liu, Yao Li, Jiliang Tang, and Ming Yan · 2019
Closest in time.
Distributed learning with compressed gradient differences
Konstantin Mishchenko, Eduard Gorbunov, Martin Takáč, and Peter Richtárik · 2019
Closest in time.
Asymptotic network independence in distributed optimization for machine learning
Alex Olshevsky, Ioannis Ch Paschalidis, and Shi Pu · 2019
Closest in time.
A non-asymptotic analysis of network independence for distributed stochastic gradient descent
Alex Olshevsky, Ioannis Ch Paschalidis, and Shi Pu · 2019
Closest in time.
Computational optimal transport
Gabriel Peyré, Marco Cuturi, et al · 2019
Closest in time.
Projected gradient method for decentralized optimization over time-varying networks
Alexander Rogozin and Alexander Gasnikov · 2019
Closest in time.
Optimal convergence rates for convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2019
Closest in time.
Gradient methods for problems with inexact model of the objective
Fedor S Stonyakin, Darina Dvinskikh, Pavel Dvurechensky, Alexey Kroshnin, Olesya Kuznetsova, Artem Agafonov, Alexander Gasnikov, Alexander Tyurin, César A Uribe, Dmitry Pasechnyuk, et al · 2019
Closest in time.
The practicality of stochastic optimization in imaging inverse problems
Junqi Tang, Karen Egiazarian, Mohammad Golbabaee, and Mike Davies · 2019
Closest in time.
Fast and faster convergence of sgd for over-parameterized models and an accelerated perceptron
Sharan Vaswani, Francis Bach, and Mark Schmidt · 2019
Closest in time.
Accelerated primal-dual algorithms for distributed smooth convex optimization over networks
Jinming Xu, Ye Tian, Ying Sun, and Gesualdo Scutari · 2019
Closest in time.
Hao Yu, Rong Jin, and Sen Yang · 2019
Closest in time.
Sa vs saa for population wasserstein barycenter calculation
Darina Dvinskikh · 2020
Closest in time.