Copertina

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Lesi, Yao, Boyuan, Luo, Luo
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2022)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2023)

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

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

Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2025)

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

On the Condition Number Dependency in Bilevel Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2025)

On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
di: Luo, Luo, et al.
Pubblicazione: (2022)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
di: Zhou, Qihao, et al.
Pubblicazione: (2024)

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

SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms
di: Abdukhakimov, Farshed, et al.
Pubblicazione: (2023)

Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(ε^{-4/7})$ Second-Order Oracle Complexity
di: Chen, Lesi, et al.
Pubblicazione: (2025)

Non-convex Stochastic Composite Optimization with Polyak Momentum
di: Gao, Yuan, et al.
Pubblicazione: (2024)

Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2022)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
di: Chen, Lesi, et al.
Pubblicazione: (2025)

Decentralized Stochastic Nonconvex Optimization under the Relaxed Smoothness
di: Luo, Luo, et al.
Pubblicazione: (2025)

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
di: Zhang, Lijun, et al.
Pubblicazione: (2023)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
di: Wu, Yidong, et al.
Pubblicazione: (2026)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
di: Gu, Zhihao, et al.
Pubblicazione: (2024)

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

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
di: Zhang, Huaqing, et al.
Pubblicazione: (2024)

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

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
di: Deng, Yuyang, et al.
Pubblicazione: (2024)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
di: Chen, Hongxu, et al.
Pubblicazione: (2026)

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

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
di: Oikonomou, Dimitris, et al.
Pubblicazione: (2024)

Faster Algorithms for User-Level Private Stochastic Convex Optimization
di: Lowy, Andrew, et al.
Pubblicazione: (2024)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
di: Oikonomou, Dimitris, et al.
Pubblicazione: (2025)

On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis
di: Chen, Lesi, et al.
Pubblicazione: (2023)

Constrained Online Convex Optimization with Polyak Feasibility Steps
di: Hutchinson, Spencer, et al.
Pubblicazione: (2025)

Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation
di: Mishkin, Aaron, et al.
Pubblicazione: (2024)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
di: Zhu, Yuchen, et al.
Pubblicazione: (2024)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
di: Lin, Tianyi, et al.
Pubblicazione: (2024)

SDEs for Minimax Optimization
di: Compagnoni, Enea Monzio, et al.
Pubblicazione: (2024)

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

An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
di: Gong, Xiaochuan, et al.
Pubblicazione: (2024)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
di: Liu, Zhuanghua, et al.
Pubblicazione: (2024)

Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching
di: Attia, Amit, et al.
Pubblicazione: (2024)

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
di: Li, Xiang, et al.
Pubblicazione: (2022)