SP2 : A Second Order Stochastic Polyak Method
Shuang Li, William J. Swartworth, Martin Takác, Deanna Needell, Robert M. Gower
Abstract
Recently the "SP" (Stochastic Polyak step size) method has emerged as a competitive adaptive method for setting the step sizes of SGD. SP can be interpreted as a method specialized to interpolated models, since it solves the interpolation equations. SP solves these equation by using local linearizations of the model. We take a step further and develop a method for solving the interpolation equations that uses the local second-order approximation of the model. Our resulting method SP2 uses Hessian-vector products to speed-up the convergence of SP. Furthermore, and rather uniquely among second-order methods, the design of SP2 in no way relies on positive definite Hessian matrices or convexity of the objective function. We show SP2 is very competitive on matrix completion, non-convex test problems and logistic regression. We also provide a convergence theory on sums-of-quadratics.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d1e92d69-00a2-4e79-a2d2-0b48b126c35fCited by top-tier papers6
- Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance ReductionXiaowen Jiang, Sebastian U. StichNeurIPS 2023 · 40 citations
- Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGradSayantan Choudhury, Nazarii Tupitsa, Nicolas Loizou, Samuel Horváth et al.NeurIPS 2024 · 10 citations
- Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient DescentPeter Richtárik, Simone Maria Giancola, Dymitr Lubczyk, Robin YadavNeurIPS 2025 · 2 citations
- Enhancing Optimizer Stability: Momentum Adaptation of The NGN Step-sizeRustem Islamov, Niccolò Ajroldi, Antonio Orvieto, Aurélien LucchiNeurIPS 2025 · 1 citation
- Methods for Convex (L0, L1)-Smooth Optimization: Clipping, Acceleration, and AdaptivityEduard Gorbunov, Nazarii Tupitsa, Sayantan Choudhury, Alen Aliev et al.ICLR 2025
Builds on1
Related papers
- SPAN: A Stochastic Projected Approximate Newton MethodXunpeng Huang, Xianfeng Liang, Zhengyang Liu, Lei Li et al.AAAI 2020 · 4 citations
- Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact SolutionAntonio Orvieto, Simon Lacoste-Julien, Nicolas LoizouNeurIPS 2022 · 57 citations
- Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)GradientsDimitris Oikonomou, Nicolas LoizouICML 2026 · 4 citations
- Enhance Curvature Information by Structured Stochastic Quasi-Newton MethodsMinghan Yang, Dong Xu, Hongyu Chen, Zaiwen Wen et al.CVPR 2021
- Directional Smoothness and Gradient Methods: Convergence and AdaptivityAaron Mishkin, Ahmed Khaled, Yuanhao Wang, Aaron Defazio et al.NeurIPS 2024 · 25 citations
