← Search

Abdurakhmon Sadiev

7 accepted papers

2025

Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum

NeurIPS 2025poster

We provide the first proof of convergence for normalized error feedback algorithms across a wide range of machine learning problems. Despite their popularity and efficiency in training deep neural networks, traditional analyses of error feedback algorithms rely on the smoothness assumption that doe…

Cited by 0SourceScholar
2025

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits

NeurIPS 2025poster

Heavy-tailed noise is pervasive in modern machine learning applications, arising from data heterogeneity, outliers, and non-stationary stochastic environments. While second-order methods can significantly accelerate convergence in light-tailed or bounded-noise settings, such algorithms are often bri…

Cited by 0SourceScholar
2024

Don't Compress Gradients in Random Reshuffling: Compress Gradient Differences

NeurIPS 2024poster

Gradient compression is a popular technique for improving communication complexity of stochastic first-order methods in distributed training of machine learning models. However, the existing works consider only with-replacement sampling of stochastic gradients. In contrast, it is well-known in pract…

Cited by 0SourcePDFScholar
2024

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise

ICML 2024oral

High-probability analysis of stochastic first-order optimization methods under mild assumptions on the noise has been gaining a lot of attention in recent years. Typically, gradient clipping is one of the key algorithmic ingredients to derive good high-probability guarantees when the noise is heavy-…

Cited by 18SourcePDFScholar
2023

High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance

ICML 2023poster

During the recent years the interest of optimization and machine learning communities in high-probability convergence of stochastic optimization methods has been growing. One of the main reasons for this is that high-probability complexity bounds are more accurate and less studied than in-expectatio…

Cited by 58SourcePDFScholar
2022

Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with an Inexact Prox

NeurIPS 2022accept

Inspired by a recent breakthrough of Mishchenko et al. [2022], who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains the same communication acceleration as their method (ProxSkip). Our approach is ve…

Cited by 27SourcePDFScholar
2022

Optimal Algorithms for Decentralized Stochastic Variational Inequalities

NeurIPS 2022accept

Variational inequalities are a formalism that includes games, minimization, saddle point, and equilibrium problems as special cases. Methods for variational inequalities are therefore universal approaches for many applied tasks, including machine learning problems. This work concentrates on the dece…

Cited by 35SourcePDFScholar