Copertina

MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Maranjyan, Artavazd, Omar, Omar Shaikh, Richtárik, Peter
Natura:	Preprint
Pubblicazione:	2024
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)

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

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

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

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

Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction
di: Tovmasyan, Zhirayr, et al.
Pubblicazione: (2026)

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

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

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

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

Birch SGD: A Tree Graph Framework for Local and Asynchronous SGD Methods
di: Tyurin, Alexander, et al.
Pubblicazione: (2025)

The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication
di: Patel, Kumar Kshitij, et al.
Pubblicazione: (2024)

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

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

Demystifying Why Local Aggregation Helps: Convergence Analysis of Hierarchical SGD
di: Wang, Jiayi, et al.
Pubblicazione: (2020)

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 Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
di: Hanzely, Filip, et al.
Pubblicazione: (2019)

Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailability
di: Xiang, Ming, et al.
Pubblicazione: (2024)

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

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

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)

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

FedCanon: Non-Convex Composite Federated Learning with Efficient Proximal Operation on Heterogeneous Data
di: Zhou, Yuan, et al.
Pubblicazione: (2025)

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

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

FIARSE: Model-Heterogeneous Federated Learning via Importance-Aware Submodel Extraction
di: Wu, Feijie, et al.
Pubblicazione: (2024)

Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization
di: Qin, Zhen, et al.
Pubblicazione: (2023)

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

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

Ordered Momentum for Asynchronous SGD
di: Shi, Chang-Wei, et al.
Pubblicazione: (2024)

Online Distributed Learning with Quantized Finite-Time Coordination
di: Bastianello, Nicola, et al.
Pubblicazione: (2023)

Communication-Efficient Federated Optimization over Semi-Decentralized Networks
di: Wang, He, et al.
Pubblicazione: (2023)

Asynchronous Policy Gradient Aggregation for Efficient Distributed Reinforcement Learning
di: Tyurin, Alexander, et al.
Pubblicazione: (2025)

A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programming
di: Nazari, Parvin, et al.
Pubblicazione: (2022)

Communication-Efficient Federated Bilevel Optimization with Local and Global Lower Level Problems
di: Li, Junyi, et al.
Pubblicazione: (2023)

Time-varying Mixing Matrix Design for Energy-efficient Decentralized Federated Learning
di: Zhang, Xusheng, et al.
Pubblicazione: (2025)

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

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