Copertina

Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Tovmasyan, Zhirayr, Maranjyan, Artavazd, Richtárik, Peter
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Distributed, Parallel, and Cluster Computing Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2025)

Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2025)

MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2024)

GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2022)

Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity
di: Mahran, Ammar, et al.
Pubblicazione: (2026)

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

LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
di: Condat, Laurent, et al.
Pubblicazione: (2024)

First Provably Optimal Asynchronous SGD for Homogeneous and Heterogeneous Data
di: Maranjyan, Artavazd
Pubblicazione: (2026)

LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging
di: Maziane, Yassine, et al.
Pubblicazione: (2026)

ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2025)

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

Distributed Stochastic Momentum Tracking with Local Updates: Achieving Optimal Communication and Iteration Complexities
di: Huang, Kun, et al.
Pubblicazione: (2025)

On Biased Compression for Distributed Learning
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2020)

Smoothed Normalization for Efficient Distributed Private Optimization
di: Shulgin, Egor, et al.
Pubblicazione: (2025)

A Bias-Correction Decentralized Stochastic Gradient Algorithm with Momentum Acceleration
di: Hu, Yuchen, et al.
Pubblicazione: (2025)

Correlated Quantization for Faster Nonconvex Distributed Optimization
di: Panferov, Andrei, et al.
Pubblicazione: (2024)

From Sequential to Parallel: Reformulating Dynamic Programming as GPU Kernels for Large-Scale Stochastic Combinatorial Optimization
di: Zhao, Jingyi, et al.
Pubblicazione: (2026)

A Hybrid Stochastic Gradient Tracking Method for Distributed Online Optimization Over Time-Varying Directed Networks
di: Shi, Xinli, et al.
Pubblicazione: (2025)

Optimizing Stochastic Gradient Push under Broadcast Communications
di: Nguyen, Tuan, et al.
Pubblicazione: (2026)

A Stochastic Approximation Approach for Efficient Decentralized Optimization on Random Networks
di: Yau, Chung-Yiu, et al.
Pubblicazione: (2024)

Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression
di: He, Yutong, et al.
Pubblicazione: (2023)

Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum
di: Zhou, Yuan, et al.
Pubblicazione: (2025)

MAST: Model-Agnostic Sparsified Training
di: Demidovich, Yury, et al.
Pubblicazione: (2023)

Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences
di: Malinovsky, Grigory, et al.
Pubblicazione: (2023)

Provable Model-Parallel Distributed Principal Component Analysis with Parallel Deflation
di: Liao, Fangshuo, et al.
Pubblicazione: (2025)

An Accelerated Distributed Stochastic Gradient Method with Momentum
di: Huang, Kun, et al.
Pubblicazione: (2024)

Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization
di: Li, Jiaxiang, et al.
Pubblicazione: (2024)

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
di: Hanzely, Filip, et al.
Pubblicazione: (2019)

Activations and Gradients Compression for Model-Parallel Training
di: Rudakov, Mikhail, et al.
Pubblicazione: (2024)

Decentralized Gradient-Free Methods for Stochastic Non-Smooth Non-Convex Optimization
di: Lin, Zhenwei, et al.
Pubblicazione: (2023)

Stochastic Controlled Averaging for Federated Learning with Communication Compression
di: Huang, Xinmeng, et al.
Pubblicazione: (2023)

UniAP: Unifying Inter- and Intra-Layer Automatic Parallelism by Mixed Integer Quadratic Programming
di: Lin, Hao, et al.
Pubblicazione: (2023)

Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction
di: Demidovich, Yury, et al.
Pubblicazione: (2024)

Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction
di: Tyurin, Alexander
Pubblicazione: (2025)

BROADCAST: Reducing Both Stochastic and Compression Noise to Robustify Communication-Efficient Federated Learning
di: Zhu, Heng, et al.
Pubblicazione: (2021)

Efficient Adaptive Federated Optimization
di: Lee, Su Hyeong, et al.
Pubblicazione: (2024)

Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis
di: Luo, Ruichen, et al.
Pubblicazione: (2025)

CONGO: Compressive Online Gradient Optimization
di: Carleton, Jeremy, et al.
Pubblicazione: (2024)

Continuous-Time Analysis of Federated Averaging
di: Overman, Tom, et al.
Pubblicazione: (2025)

On Principled Local Optimization Methods for Federated Learning
di: Yuan, Honglin
Pubblicazione: (2024)