Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation
Xiao-Tong Yuan, Ping Li

TL;DR
This paper introduces a minibatch stochastic proximal point method (M-SPP) for convex optimization, providing novel excess risk bounds, convergence rates, and high-probability error bounds, with empirical validation on Lasso and logistic regression.
Contribution
The paper develops a new M-SPP algorithm with theoretical excess risk bounds and convergence rates, improving understanding of noise impact and extending to sampling-without-replacement variants.
Findings
M-SPP achieves an $rac{1}{T^2}$ bias decay rate.
Variance decays at a rate of $rac{1}{nT}$.
Numerical experiments support theoretical predictions.
Abstract
The stochastic proximal point (SPP) methods have gained recent attention for stochastic optimization, with strong convergence guarantees and superior robustness to the classic stochastic gradient descent (SGD) methods showcased at little to no cost of computational overhead added. In this article, we study a minibatch variant of SPP, namely M-SPP, for solving convex composite risk minimization problems. The core contribution is a set of novel excess risk bounds of M-SPP derived through the lens of algorithmic stability theory. Particularly under smoothness and quadratic growth conditions, we show that M-SPP with minibatch-size and iteration count enjoys an in-expectation fast rate of convergence consisting of an bias decaying term and an variance decaying term. In the small--large- setting, this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Sparse and Compressive Sensing Techniques
MethodsLogistic Regression
