activity
20182025
most citedOn the Convergence of Federated Learning Algorithms without Data Similarity

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

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2025

Better LMO-based Momentum Methods with Second-Order Information

Sarit Khirirat, Abdurakhmon Sadiev, Yury Demidovich +1

The use of momentum in stochastic optimization algorithms has shown empirical success across a range of machine learning tasks. Recently, a new class of stochastic momentum algorit…

math.OC2025

Improved Convergence in Parameter-Agnostic Error Feedback through Momentum

Abdurakhmon Sadiev, Yury Demidovich, Igor Sokolov +3

Communication compression is essential for scalable distributed training of modern machine learning models, but it often degrades convergence due to the noise it introduces. Error…

math.OC2022

Zeroth-Order Randomized Subspace Newton Methods

Erik Berglund, Sarit Khirirat, Xiaoyu Wang

Zeroth-order methods have become important tools for solving problems where we have access only to function evaluations. However, the zeroth-order methods only using gradient appro…

math.OC2020

A flexible framework for communication-efficient machine learning: from HPC to IoT

Sarit Khirirat, Sindri Magnússon, Arda Aytekin +1

With the increasing scale of machine learning tasks, it has become essential to reduce the communication between computing nodes. Early work on gradient compression focused on the…

math.OC2018

Distributed learning with compressed gradients

Sarit Khirirat, Hamid Reza Feyzmahdavian, Mikael Johansson

Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This pa…