:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Hermant, Julien
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2602.10022
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
by: Kuruzov, Ilya, et al.
Published: (2022)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
by: Hermant, Julien, et al.
Published: (2024)

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)

High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
by: Kar, Avik, et al.
Published: (2026)

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

A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
by: Xu, Ziqing, et al.
Published: (2025)

Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant
by: Kong, Qingyuan, et al.
Published: (2024)

Gradient correlation is a key ingredient to accelerate SGD with momentum
by: Hermant, Julien, et al.
Published: (2024)

Continuized Nesterov Acceleration for Non-Convex Optimization
by: Hermant, Julien, et al.
Published: (2025)

Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares
by: Boumal, Nicolas, et al.
Published: (2026)

The ballistic limit of the log-Sobolev constant equals the Polyak-Łojasiewicz constant
by: Chewi, Sinho, et al.
Published: (2024)

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs
by: Daudin, Samuel, et al.
Published: (2025)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions
by: Nejma, Aziz Ben
Published: (2025)

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)

Polyak's Heavy Ball Method Achieves Accelerated Local Rate of Convergence under Polyak-Lojasiewicz Inequality
by: Kassing, Sebastian, et al.
Published: (2024)

Accelerating Level-Value Adjustment for the Polyak Stepsize
by: Liu, Anbang, et al.
Published: (2023)

Polyak-Lojasiewicz Inequality for Quadratically Regularized Optimal Transport
by: González-Sanz, Alberto, et al.
Published: (2026)

Optimal local linear convergence of Nesterov's accelerated gradient method for $C^2$ functions under the Polyak--Łojasiewicz inequality
by: Feng, Zixu, et al.
Published: (2026)

Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
by: Choi, Hyung Jun, et al.
Published: (2023)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

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

Continuized Nesterov Momentum Achieves the $O(\varepsilon^{-7/4})$ Complexity without Additional Mechanisms
by: Hermant, Julien, et al.
Published: (2026)

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

Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption
by: Kanzow, Christian, et al.
Published: (2024)

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

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

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

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak--$Ł$ojasiewicz Condition
by: Xu, Lei, et al.
Published: (2022)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
by: Phunyaphibarn, Prin, et al.
Published: (2023)

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

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

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

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

Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration
by: Takahashi, Shota
Published: (2026)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
by: Oikonomou, Dimitris, 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)

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