Cover Image

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Karagulyan, Avetik, Shulgin, Egor, Sadiev, Abdurakhmon, Richtárik, Peter
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C26
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)

Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
by: Li, Hanmin, et al.
Published: (2023)

Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity
by: Sadiev, Abdurakhmon, et al.
Published: (2024)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
by: Milzarek, Andre, et al.
Published: (2022)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

Better LMO-based Momentum Methods with Second-Order Information
by: Khirirat, Sarit, et al.
Published: (2025)

A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods
by: Sadiev, Abdurakhmon, et al.
Published: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method
by: Sadiev, Abdurakhmon, et al.
Published: (2026)

Stabilized Proximal Point Method via Trust Region Control
by: Li, Hanmin, et al.
Published: (2026)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2026)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
by: Fradin, Adrien, et al.
Published: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
by: Sadiev, Abdurakhmon, et al.
Published: (2025)

Projected Gradient Methods with Momentum
by: Lapucci, Matteo, et al.
Published: (2026)

Tracking the Median of Gradients with a Stochastic Proximal Point Method
by: Schaipp, Fabian, et al.
Published: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
by: Xie, Yue, et al.
Published: (2024)

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
by: Qiu, Junwen, et al.
Published: (2023)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

Differentially Private Random Block Coordinate Descent
by: Maranjyan, Artavazd, et al.
Published: (2024)

Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
by: Rammal, Ahmad, et al.
Published: (2023)

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)

On the Convergence of DP-SGD with Adaptive Clipping
by: Shulgin, Egor, et al.
Published: (2024)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
by: Qiu, Junwen, et al.
Published: (2024)

Improved Convergence in Parameter-Agnostic Error Feedback through Momentum
by: Sadiev, Abdurakhmon, et al.
Published: (2025)

Towards a Better Theoretical Understanding of Independent Subnetwork Training
by: Shulgin, Egor, et al.
Published: (2023)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
by: Hamana, Shodai, et al.
Published: (2026)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong, et al.
Published: (2024)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
by: Zhao, Lei, et al.
Published: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
by: Li, Luxuan, et al.
Published: (2026)