Convergence of Stochastic Proximal Gradient Algorithm
Not on the map. Why?
Abstract (arXiv)
We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth component. We consider the iterates convergence and derive O(1/n) non asymptotic bounds in expectation in the strongly convex case, as well as almost sure convergence results under weaker assumptions. Our approach allows to avoid averaging and weaken boundedness assumptions which are often considered in theoretical studies and might not be satisfied in practice.
Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Mar 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 5; 2023: 3; 2024: 5; 2025: 0; 2026: 2.
17 papers.
Sort:
- 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGDcited by 41
- 2024Implicit Diffusion: Efficient Optimization through Stochastic Samplingcited by 22
- 2021A Bregman Learning Framework for Sparse Neural Networkscited by 15
- 2022A Unified Convergence Theorem for Stochastic Optimization Methodscited by 12
- 2022Lifted Bregman Training of Neural Networkscited by 10
- 2022Stochastic Zeroth order Descent with Structured Directionscited by 8
- 2024Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networkscited by 8
- 2023A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Propertiescited by 5
- 2021Universal Regular Conditional Distributionscited by 4
- 2023A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimizationcited by 4
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descentcited by 3
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Ratescited by 2
5 more
- 2022Sharper Bounds for Proximal Gradient Algorithms with Errorscited by 1
- 2022Iterative regularization in classification via hinge loss diagonal descentcited by 0
- 2024Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimizationcited by 0
- 2024Proximal Iteration for Nonlinear Adaptive Lassocited by 0
- 2026Learning Theory of the SVRG: Generalization and Convergence Analysiscited by 0
- 2026Learning Theory of the SVRG: Generalization and Convergence Analysis27 May 2026
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descent3 Feb 2026
- 2024Proximal Iteration for Nonlinear Adaptive Lasso7 Dec 2024
- 2024Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization27 Jun 2024
- 2024Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks29 Apr 2024
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates18 Mar 2024
- 2024Implicit Diffusion: Efficient Optimization through Stochastic Sampling8 Feb 2024
- 2023A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization2 Dec 2023
- 2023A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties10 May 2023
- 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD13 Feb 2023
- 2022Iterative regularization in classification via hinge loss diagonal descent24 Dec 2022
- 2022Lifted Bregman Training of Neural Networks18 Aug 2022
5 more
- 2022Stochastic Zeroth order Descent with Structured Directions10 Jun 2022
- 2022A Unified Convergence Theorem for Stochastic Optimization Methods8 Jun 2022
- 2022Sharper Bounds for Proximal Gradient Algorithms with Errors4 Mar 2022
- 2021Universal Regular Conditional Distributions17 May 2021
- 2021A Bregman Learning Framework for Sparse Neural Networks10 May 2021
- 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGDcited by 41
- 2024Implicit Diffusion: Efficient Optimization through Stochastic Samplingcited by 22
- 2021A Bregman Learning Framework for Sparse Neural Networkscited by 15
- 2022A Unified Convergence Theorem for Stochastic Optimization Methodscited by 12
- 2022Lifted Bregman Training of Neural Networkscited by 10
- 2022Stochastic Zeroth order Descent with Structured Directionscited by 8
- 2024Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networkscited by 8
- 2023A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Propertiescited by 5
- 2021Universal Regular Conditional Distributionscited by 4
- 2023A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimizationcited by 4
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descentcited by 3
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Ratescited by 2
12 most cited of 17 All 17 (JSON)
- 2026Learning Theory of the SVRG: Generalization and Convergence Analysis27 May 2026
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descent3 Feb 2026
- 2024Proximal Iteration for Nonlinear Adaptive Lasso7 Dec 2024
- 2024Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization27 Jun 2024
- 2024Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks29 Apr 2024
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates18 Mar 2024
- 2024Implicit Diffusion: Efficient Optimization through Stochastic Sampling8 Feb 2024
- 2023A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization2 Dec 2023
- 2023A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties10 May 2023
- 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD13 Feb 2023
- 2022Iterative regularization in classification via hinge loss diagonal descent24 Dec 2022
- 2022Lifted Bregman Training of Neural Networks18 Aug 2022
12 newest of 17 All 17 (JSON)