Image de couverture de livre

Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sadiev, Abdurakhmon, Condat, Laurent, Richtárik, Peter
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods
par: Sadiev, Abdurakhmon, et autres
Publié: (2026)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
par: Condat, Laurent, et autres
Publié: (2026)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
par: Fradin, Adrien, et autres
Publié: (2025)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
par: Richtárik, Peter, et autres
Publié: (2024)

Revisiting Stochastic Proximal Point Methods: Generalized Smoothness and Similarity
par: Tovmasyan, Zhirayr, et autres
Publié: (2025)

The Stochastic Multi-Proximal Method for Nonsmooth Optimization
par: Condat, Laurent, et autres
Publié: (2025)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
par: Karagulyan, Avetik, et autres
Publié: (2024)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
par: Sadiev, Abdurakhmon, et autres
Publié: (2025)

A Simple Linear Convergence Analysis of the Point-SAGA Algorithm
par: Condat, Laurent, et autres
Publié: (2024)

Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization
par: Condat, Laurent, et autres
Publié: (2025)

Better LMO-based Momentum Methods with Second-Order Information
par: Khirirat, Sarit, et autres
Publié: (2025)

Differentially Private Random Block Coordinate Descent
par: Maranjyan, Artavazd, et autres
Publié: (2024)

Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method
par: Sadiev, Abdurakhmon, et autres
Publié: (2026)

BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training
par: Condat, Laurent, et autres
Publié: (2026)

Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation
par: Sokolov, Igor, et autres
Publié: (2025)

Improved Convergence in Parameter-Agnostic Error Feedback through Momentum
par: Sadiev, Abdurakhmon, et autres
Publié: (2025)

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
par: Gorbunov, Eduard, et autres
Publié: (2023)

Stochastic Gradient Methods with Preconditioned Updates
par: Sadiev, Abdurakhmon, et autres
Publié: (2022)

LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
par: Condat, Laurent, et autres
Publié: (2024)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
par: Meinhardt, Georg, et autres
Publié: (2024)

TAMUNA: Doubly Accelerated Distributed Optimization with Local Training, Compression, and Partial Participation
par: Condat, Laurent, et autres
Publié: (2023)

Speeding up Stochastic Proximal Optimization in the High Hessian Dissimilarity Setting
par: Gasanov, Elnur, et autres
Publié: (2024)

Stabilized Proximal Point Method via Trust Region Control
par: Li, Hanmin, et autres
Publié: (2026)

Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
par: Le, Ba Khiet, et autres
Publié: (2026)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
par: Gruntkowska, Kaja, et autres
Publié: (2025)

Stochastic Monotone Inclusion with Closed Loop Distributions
par: Ennaji, Hamza, et autres
Publié: (2024)

Bregman Proximal Method for Efficient Communications under Similarity
par: Beznosikov, Aleksandr, et autres
Publié: (2023)

Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization
par: Gruntkowska, Kaja, et autres
Publié: (2025)

On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
par: Tyurin, Alexander, et autres
Publié: (2024)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
par: Liang, Ling, et autres
Publié: (2024)

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
par: Gruntkowska, Kaja, et autres
Publié: (2024)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
par: Condat, Laurent, et autres
Publié: (2022)

Asymptotic Analysis of an Abstract Stochastic Scheme for Solving Monotone Inclusions
par: Combettes, Patrick L., et autres
Publié: (2025)

Monotonicity of Pairs of Operators and Generalized Inertial Proximal Method
par: Le, Ba Khiet, et autres
Publié: (2026)

Inertial Quasi-Newton Methods for Monotone Inclusion: Efficient Resolvent Calculus and Primal-Dual Methods
par: Wang, Shida, et autres
Publié: (2022)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
par: Wang, Zepeng, et autres
Publié: (2025)

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
par: Guo, Luyao, et autres
Publié: (2023)

Solving Non-Monotone Inclusions Using Monotonicity of Pairs of Operators
par: Le, Ba Khiet, et autres
Publié: (2025)

Near-Linear Time Projection onto the $\ell_{1,\infty}$ Ball; Application to Sparse Autoencoders
par: Perez, Guillaume, et autres
Publié: (2023)

Stochastic Differential Inclusions driven by Maximal Monotone Operators with empty interiors
par: Garrido, Juan Guillermo, et autres
Publié: (2026)