Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method). - Pavel E. Dvurechensky; Alexander V. Gasnikov; Alexander Tiurin (CoRR, 2017)

Gradient Methods for Problems with Inexact Model of the Objective. - Fedor S. Stonyakin; Darina Dvinskikh; Pavel E. Dvurechensky; Alexey Kroshnin; Olesya Kuznetsova; Artem Agafonov; Alexander V. Gasnikov; Alexander Tyurin; César A. Uribe; Dmitry Pasechnyuk; Sergei Artamonov (MOTOR, 2019)

A Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport. - Pavel E. Dvurechensky; Alexander V. Gasnikov; Sergey Omelchenko; Alexander Tiurin (MOTOR, 2020)

Inexact model: a framework for optimization and variational inequalities. - Fedor S. Stonyakin; Alexander Tyurin; Alexander V. Gasnikov; Pavel E. Dvurechensky; Artem Agafonov; Darina Dvinskikh; Mohammad S. Alkousa; Dmitry Pasechnyuk; Sergei Artamonov; Victoria V. Piskunova (Optim. Methods Softw., 2021)

Permutation Compressors for Provably Faster Distributed Nonconvex Optimization. - Rafal Szlendak; Alexander Tyurin; Peter Richtárik (ICLR, 2022)

Modeling and cleaning RNA-seq data significantly improve detection of differentially expressed genes. - Igor V. Deyneko; Orkhan N. Mustafaev; Alexander Tyurin; Ksenya V. Zhukova; Alexander Varzari; Irina V. Goldenkova-Pavlova (BMC Bioinform., 2022)

DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization. - Alexander Tyurin; Peter Richtárik (CoRR, 2022)

Oracle Complexity Separation in Convex Optimization. - Anastasiya Ivanova; Pavel E. Dvurechensky; Evgeniya A. Vorontsova; Dmitry Pasechnyuk; Alexander V. Gasnikov; Darina Dvinskikh; Alexander Tyurin (J. Optim. Theory Appl., 2022)

DASHA: Distributed Nonconvex Optimization with Communication Compression and Optimal Oracle Complexity. - Alexander Tyurin; Peter Richtárik (ICLR, 2023)

EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression. - Kaja Gruntkowska; Alexander Tyurin; Peter Richtárik (ICML, 2023)

Momentum Provably Improves Error Feedback! - Ilyas Fatkhullin; Alexander Tyurin; Peter Richtárik (NeurIPS, 2023)

2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression. - Alexander Tyurin; Peter Richtárik (NeurIPS, 2023)

Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model. - Alexander Tyurin; Peter Richtárik (NeurIPS, 2023)

A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting. - Alexander Tyurin; Peter Richtárik (NeurIPS, 2023)

Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling. - Alexander Tyurin; Lukang Sun; Konstantin Burlachenko; Peter Richtárik (Trans. Mach. Learn. Res., 2023)

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity. - Kaja Gruntkowska; Alexander Tyurin; Peter Richtárik (NeurIPS, 2024)

Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations. - Alexander Tyurin; Kaja Gruntkowska; Peter Richtárik (NeurIPS, 2024)

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity. - Alexander Tyurin; Marta Pozzi; Ivan Ilin; Peter Richtárik (NeurIPS, 2024)

On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization. - Alexander Tyurin; Peter Richtárik (NeurIPS, 2024)

Tighter Performance Theory of FedExProx. - Wojciech Anyszka; Kaja Gruntkowska; Alexander Tyurin; Peter Richtárik (CoRR, 2024)

From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes. - Alexander Tyurin (AAAI, 2025)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics. - Alexander Tyurin (ICLR, 2025)

Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity. - Artavazd Maranjyan; Alexander Tyurin; Peter Richtárik (CoRR, 2025)

Birch SGD: A Tree Graph Framework for Local and Asynchronous SGD Methods. - Alexander Tyurin; Danil Sivtsov (CoRR, 2025)

Learning of Population Dynamics: Inverse Optimization Meets JKO Scheme. - Mikhail Persiianov; Jiawei Chen; Petr Mokrov; Alexander Tyurin; Evgeny Burnaev; Alexander Korotin (CoRR, 2025)

Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction. - Alexander Tyurin (CoRR, 2025)