Fetching the paper…
Reading the bibliography…
We consider the problem of minimizing the sum of three convex functions: i) a smooth function $f$ in the form of an expectation or a finite average, ii) a non-smooth function $g$ in the form of a finite average of proximable functions $g_j$, and iii) a proximable regularizer $R$.
Angenaherte auflosung von systemen linearer glei-chungen
Stefan Kaczmarz · 1937
Earlier work this paper cites.
Splitting algorithms for the sum of two nonlinear operators
Pierre-Louis Lions and Bertrand Mercier · 1979
Earlier work this paper cites.
An algorithm for restricted least squares regression
Richard L. Dykstra · 1983
Earlier work this paper cites.
Support-vector networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
On projection algorithms for solving convex feasibility problems
Heinz H. Bauschke and Jonathan M. Borwein · 1996
Earlier work this paper cites.
Sparsity and smoothness via the fused lasso
Robert Tibshirani, Michael Saunders, Saharon Rosset, Ji Zhu, and Keith Knight · 2005
Earlier work this paper cites.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Emmanuel J. Candès, Justin Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen J. Wright · 2006
Earlier work this paper cites.
Model selection and estimation in regression with grouped variables
Ming Yuan and Yi Lin · 2006
Earlier work this paper cites.
The Dantzig selector: Statistical estimation when p p is much larger than n n
Emmanuel Candès and Terence Tao · 2007
Earlier work this paper cites.
Pegasos: Primal estimated subgradient solver for SVM
Shai Shalev-Shwartz, Yoram Singer, and Nathan Srebro · 2007
Earlier work this paper cites.
Efficient online and batch learning using forward backward splitting
John Duchi and Yoram Singer · 2009
Earlier work this paper cites.
ℓ 1 \ell_{1} trend filtering
Seung-Jean Kim, Kwangmoo Koh, Stephen Boyd, and Dimitry Gorinevsky · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedić and Asuman Özdağlar · 2009
Earlier work this paper cites.
A randomized Kaczmarz algorithm with exponential convergence
Thomas Strohmer and Roman Vershynin · 2009
Earlier work this paper cites.
Total generalized variation
Kristian Bredies, Karl Kunisch, and Thomas Pock · 2010
Earlier work this paper cites.
Square-root lasso: pivotal recovery of sparse signals via conic programming
Alexandre Belloni, Victor Chernozhukov, and Lie Wang · 2011
Earlier work this paper cites.
LibSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Fixed-Point Algorithms for Inverse Problems in Science and Engineering
Patrick Louis Combettes and Jean-Christophe Pesquet · 2011
Earlier work this paper cites.
Pegasos: Primal estimated sub-gradient solver for SVM
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, and Andrew Cotter · 2011
Earlier work this paper cites.
A stochastic gradient method with an exponential convergence rate for finite training sets
Nicolas Le Roux, Mark Schmidt, and Francis Bach · 2012
Earlier work this paper cites.
A primal–dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
Laurent Condat · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Mini-batch primal and dual methods for SVMs
Martin Takáč, Avleen Bijral, Peter Richtárik, and Nathan Srebro · 2013
Cited alongside, same era.
A splitting algorithm for dual monotone inclusions involving cocoercive operators
Băng C. Vũ · 2013
Cited alongside, same era.
SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Parallel multi-block ADMM with o ( 1 / k ) o(1/k) convergence
Wei Deng, Ming-Jun Lai, Zhimin Peng, and Wotao Yin · 2017
Later among the works it cites.
Faster PET reconstruction with a stochastic primal-dual hybrid gradient method
Matthias J. Ehrhardt, Pawel Markiewicz, Antonin Chambolle, Peter Richtárik, Jonathan Schott, and Carola-Bibiane Schönlieb · 2017
Later among the works it cites.
Less than a single pass: Stochastically controlled stochastic gradient
Lihua Lei and Michael Jordan · 2017
Later among the works it cites.
Non-convex finite-sum optimization via SCSG methods
Lihua Lei, Cheng Ju, Jianbo Chen, and Michael I. Jordan · 2017
Later among the works it cites.
Accelerated variance reduced stochastic ADMM
Yuanyuan Liu, Fanhua Shang, and James Cheng · 2017
Later among the works it cites.
Breaking locality accelerates block Gauss-Seidel
Stephen Tu, Shivaram Venkataraman, Ashia C. Wilson, Alex Gittens, Michael I. Jordan, and Benjamin Recht · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
Convex optimization algorithms
Dimitri P. Bertsekas · 2015
Cited alongside, same era.
A coordinate descent primal-dual algorithm and application to distributed asynchronous optimization
Pascal Bianchi, Walid Hachem, and Franck Iutzeler · 2015
Cited alongside, same era.
Stochastic quasi-fejér block-coordinate fixed point iterations with random sweeping
Patrick L. Combettes and Jean-Christophe Pesquet · 2015
Cited alongside, same era.
Randomized iterative methods for linear systems
Robert M. Gower and Peter Richtárik · 2015
Cited alongside, same era.
Variance reduced stochastic gradient descent with neighbors
Thomas Hofmann, Aurelien Lucchi, Simon Lacoste-Julien, and Brian McWilliams · 2015
Cited alongside, same era.
Later among the works it cites.
Fast stochastic variance reduced admm for stochastic composition optimization
Yue Yu and Longbo Huang · 2017
Later among the works it cites.
Stochastic forward-Douglas-Rachford splitting for monotone inclusions
Volkan Cevher, Băng C. Vũ, and Alp Yurtsever · 2018
Later among the works it cites.
Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications
Antonin Chambolle, Matthias J. Ehrhardt, Peter Richtárik, and Carola-Bibiane Schönlieb · 2018
Later among the works it cites.
Accelerated stochastic matrix inversion: general theory and speeding up BFGS rules for faster second-order optimization
Robert M. Gower, Filip Hanzely, Peter Richtárik, and Sebastian U. Stich · 2018
Later among the works it cites.
SEGA: variance reduction via gradient sketching
Filip Hanzely, Konstantin Mishchenko, and Peter Richtárik · 2018
Later among the works it cites.
A stochastic penalty model for convex and nonconvex optimization with big constraints
Konstantin Mishchenko and Peter Richtárik · 2018
Later among the works it cites.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
Simon S. Du and Wei Hu · 2019
Closest in time.
Proximal splitting meets variance reduction
Fabian Pedregosa, Kilian Fatras, and Mattia Casotto · 2019
Closest in time.
SAGA with arbitrary sampling
Xun Qian, Zheng Qu, and Peter Richtárik · 2019
Closest in time.
Proximal-proximal-gradient method
Ernest K. Ryu and Wotao Yin · 2019
Closest in time.
Unsupervised image matching and object discovery as optimization
Huy V. Vo, Francis Bach, Minsu Cho, Kai Han, Yann LeCun, Patrick Pérez, and Jean Ponce · 2019
Closest in time.
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
Robert M. Gower, Peter Richtárik, and Francis Bach · 2020
Closest in time.
Don’t jump through hoops and remove those loops: SVRG and Katyusha are better without the outer loop
Dmitry Kovalev, Samuel Horváth, and Peter Richtárik · 2020
Closest in time.
Stochastic reformulations of linear systems: Algorithms and convergence theory
Peter Richtárik and Martin Takáč · 2020
Closest in time.
Inexact SARAH algorithm for stochastic optimization
Lam M. Nguyen, Katya Scheinberg, and Martin Takáč · 2021
Closest in time.