activity
20222026
most citedGradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity

1 citations · 1 across the 10 of their papers we have counts for

collaborators
Showing math.OCShow all

7 papers · 1 filter

math.OC2026

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

Zhirayr Tovmasyan, Artavazd Maranjyan, Peter Richtárik

Large-scale machine learning models are trained on clusters of machines that exhibit heterogeneous performance due to hardware variability, network delays, and system-level instabi…

math.OC2026

BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training

Laurent Condat, Artavazd Maranjyan, Peter Richtárik

Slow and costly communication is often the main bottleneck in distributed optimization, especially in federated learning where it occurs over wireless networks. We introduce BiCoLo…

math.OC2026

First Provably Optimal Asynchronous SGD for Homogeneous and Heterogeneous Data

Artavazd Maranjyan

Artificial intelligence has advanced rapidly through large neural networks trained on massive datasets using thousands of GPUs or TPUs. Such training can occupy entire data centers…

math.OC2025

Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity

Artavazd Maranjyan, Peter Richtárik

Asynchronous stochastic gradient methods are central to scalable distributed optimization, particularly when devices differ in computational capabilities. Such settings arise natur…

math.OC2024

Differentially Private Random Block Coordinate Descent

Artavazd Maranjyan, Abdurakhmon Sadiev, Peter Richtárik

Coordinate Descent (CD) methods have gained significant attention in machine learning due to their effectiveness in solving high-dimensional problems and their ability to decompose…

math.OC2024

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

Artavazd Maranjyan, Omar Shaikh Omar, Peter Richtárik

We investigate the problem of minimizing the expectation of smooth nonconvex functions in a distributed setting with multiple parallel workers that are able to compute stochastic g…

math.OC2024

LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression

Laurent Condat, Artavazd Maranjyan, Peter Richtárik

In Distributed optimization and Learning, and even more in the modern framework of federated learning, communication, which is slow and costly, is critical. We introduce LoCoDL, a…