Alexander Tyurin
15 papers · 2022–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
π Conference Polyglot (4) π Cross-Pollinator (9) π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (19)
πΊ
Lone Wolf
(3)
π
Keyword Champion
(2)
π
Triple Crown
π
Grand Slam
π€
Dynamic Duo
(12)
β‘
Prolific Year
(6)
π
Century Club
(15)
Conferences
NIPS (8)
ICLR (3)
ICML (3)
AAAI (1)
Top co-authors
Keywords
communication compression
(5)
distributed optimization
(5)
asynchronous optimization
(4)
stochastic gradient
(4)
stochastic optimization
(3)
nonconvex optimization
(3)
communication complexity
(3)
gradient compression
(2)
error feedback
(2)
bidirectional compression
(2)
time complexity
(2)
distributed learning
(2)
oracle complexity
(1)
minimax complexity
(1)
parallel optimization
(1)
convergence rate
(1)
iteration complexity
(1)
distributed stochastic gradient descent
(1)
stochastic method
(1)
partial participation
(1)
Papers
Toward a Unified Theory of Gradient Descent under Generalized Smoothness
ICML 2025
Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
ICML 2025
Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
ICLR 2025
From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes
AAAI 2025
On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
NIPS 2024
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
NIPS 2024
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
NIPS 2024
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
NIPS 2024
Momentum Provably Improves Error Feedback!
NIPS 2023
Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model
NIPS 2023
DASHA: Distributed Nonconvex Optimization with Communication Compression and Optimal Oracle Complexity
ICLR 2023
2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression
NIPS 2023
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression
ICML 2023
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
NIPS 2023
Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
ICLR 2022