Cover Image

Non-convex Stochastic Composite Optimization with Polyak Momentum

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gao, Yuan, Rodomanov, Anton, Stich, Sebastian U.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Composite Optimization with Error Feedback: the Dual Averaging Approach
by: Gao, Yuan, et al.
Published: (2025)

Non-Convex Federated Optimization under Cost-Aware Client Selection
by: Jiang, Xiaowen, et al.
Published: (2025)

Accelerated Distributed Optimization with Compression and Error Feedback
by: Gao, Yuan, et al.
Published: (2025)

Federated Optimization with Doubly Regularized Drift Correction
by: Jiang, Xiaowen, et al.
Published: (2024)

Stabilized Proximal-Point Methods for Federated Optimization
by: Jiang, Xiaowen, et al.
Published: (2024)

Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
by: Takezawa, Yuki, et al.
Published: (2025)

DADA: Dual Averaging with Distance Adaptation
by: Moshtaghifar, Mohammad, et al.
Published: (2025)

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

Towards Faster Decentralized Stochastic Optimization with Communication Compression
by: Islamov, Rustem, et al.
Published: (2024)

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

Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods
by: Vankov, Daniil, et al.
Published: (2024)

Random Scaling and Momentum for Non-smooth Non-convex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)

Scalable Decentralized Learning with Teleportation
by: Takezawa, Yuki, et al.
Published: (2025)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Efficient Gradient Methods for Distributed Saddle Problems
by: Luo, Ruichen, et al.
Published: (2026)

FedMuon: Federated Learning with Bias-corrected LMO-based Optimization
by: Takezawa, Yuki, et al.
Published: (2025)

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

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)

Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe
by: Chayti, El Mahdi
Published: (2026)

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

Locally Adaptive Federated Learning
by: Mukherjee, Sohom, et al.
Published: (2023)

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

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

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

Stochastic Difference-of-Convex Optimization with Momentum
by: Chayti, El Mahdi, et al.
Published: (2025)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
by: Sun, Zhenyu, et al.
Published: (2024)

Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates
by: Zhang, Siqi, et al.
Published: (2023)

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

Online Non-convex Optimization with Long-term Non-convex Constraints
by: Pan, Shijie, et al.
Published: (2023)

On the Provable Suboptimality of Momentum SGD in Nonstationary Stochastic Optimization
by: Sahu, Sharan, et al.
Published: (2026)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
by: Liu, Wei, et al.
Published: (2025)

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

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)

Stochastic Compositional Optimization with Compositional Constraints
by: Yang, Shuoguang, et al.
Published: (2022)

Global Complexity Analysis of BFGS
by: Rodomanov, Anton
Published: (2024)

Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
by: Cai, Haoyuan, et al.
Published: (2024)

Oblivious Stochastic Composite Optimization
by: Lezane, Clément, et al.
Published: (2023)

Improving Stochastic Cubic Newton with Momentum
by: Chayti, El Mahdi, et al.
Published: (2024)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
by: Karagulyan, Avetik, et al.
Published: (2024)