Cover Image

Accelerating Level-Value Adjustment for the Polyak Stepsize

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Anbang, Bragin, Mikhail A., Chen, Xi, Guan, Xiaohong
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Polyak Stepsize with Level-value Adjustment for Distributed Optimization
by: Ouyang, Chen, et al.
Published: (2026)

Polyak Stepsize: Estimating Optimal Functional Values Without Parameters or Prior Knowledge
by: Abdukhakimov, Farshed, et al.
Published: (2025)

Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates
by: Wu, Haotian
Published: (2025)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
by: Orabona, Francesco, et al.
Published: (2025)

Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution
by: Orvieto, Antonio, et al.
Published: (2022)

Acceleration by Stepsize Hedging II: Silver Stepsize Schedule for Smooth Convex Optimization
by: Altschuler, Jason M., et al.
Published: (2023)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2024)

Accelerated Gradient Descent by Concatenation of Stepsize Schedules
by: Zhang, Zehao, et al.
Published: (2024)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)

Acceleration for Polyak-Łojasiewicz Functions with a Gradient Aiming Condition
by: Hermant, Julien
Published: (2026)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
by: Altschuler, Jason M., et al.
Published: (2026)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction
by: Rodomanov, Anton, et al.
Published: (2024)

Adaptive Stepsize Selection in Decentralized Convex Optimization
by: Kuruzov, Ilya, et al.
Published: (2025)

Accelerating Proximal Gradient Descent via Silver Stepsizes
by: Bok, Jinho, et al.
Published: (2024)

Polyak Minorant Method for Convex Optimization
by: Devanathan, Nikhil, et al.
Published: (2023)

Accelerated Price Adjustment for Fisher Markets with Exact Recovery of Competitive Equilibrium
by: Chen, He, et al.
Published: (2025)

Generalization of Silver Stepsize Schedule to Stochastic Optimization
by: Bai, Luwei, et al.
Published: (2025)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares
by: Peng, Liangzu, et al.
Published: (2024)

A modified Polak-Ribiere-Polyak type conjugate gradient method with two stepsize strategies for vector optimization
by: Bai, Yushan, et al.
Published: (2024)

Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias
by: Malitsky, Yura, et al.
Published: (2025)

Distributed Optimization and Learning for Automated Stepsize Selection with Finite Time Coordination
by: Rikos, Apostolos I., et al.
Published: (2025)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, et al.
Published: (2023)

Post-estimation Adjustments in Data-driven Decision-making with Applications in Pricing
by: Albert, Michael, et al.
Published: (2025)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Integrated Offline and Online Learning to Solve a Large Class of Scheduling Problems
by: Liu, Anbang, et al.
Published: (2025)

A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Revisiting the Constant Stepsize Stochastic Approximation with Decision-Dependent Markovian Noise
by: Hadavi, Hadi, et al.
Published: (2026)

The Popov's Algorithm with Optimal Bounded Stepsize for Generalized Monotone Variational Inequalities
by: Nguyen, Nhung Hong, et al.
Published: (2026)

Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes
by: Huo, Dongyan, et al.
Published: (2022)

AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updates
by: Zhang, Minxin, et al.
Published: (2025)

AdGT: Decentralized Gradient Tracking with Tuning-free Per-Agent Stepsize
by: Ghaderyan, Diyako, et al.
Published: (2025)

Remarks on the Polyak-Lojasiewicz inequality and the convergence of gradient systems
by: de Oliveira, Arthur Castello B., et al.
Published: (2025)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
by: Jiang, Tao, et al.
Published: (2025)

Online Stochastic Gradient Methods Under Sub-Weibull Noise and the Polyak-Łojasiewicz Condition
by: Kim, Seunghyun, et al.
Published: (2021)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient Descent
by: Richtárik, Peter, et al.
Published: (2024)