Co-occurring keywords · papers mentioning both
Papers
Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
ICLR 2025
Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods
ICLR 2025
Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
ICLR 2025
Parameter-free Clipped Gradient Descent Meets Polyak
NeurIPS 2024
Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction
NeurIPS 2023
Generalized Polyak Step Size for First Order Optimization with Momentum
ICML 2023
Towards Statistical and Computational Complexities of Polyak Step Size Gradient Descent
AISTATS 2022
Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence
AISTATS 2021