Alexander Tyurin
15 papers · 2022–2025 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (19) 🌍 Conference Polyglot · Bronze 🤝 Dynamic Duo (12) 👑 Triple Crown
🏆
Grand Slam
🔬
Deep Specialist
(12)
🗃️
Keyword Collector
(57)
⚡
Prolific Year · Productive
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Machine Learning
(15)
Optimization & Theory · Machine Learning
(15)
Mathematics & Optimization
(9)
Optimization
(9)
Artificial Intelligence
(1)
Computer Science
(1)
Deep Learning
(1)
Application Areas
(1)
Core Methods
(1)
Learning Paradigms · Artificial Intelligence
(1)
Learning Paradigms · Machine Learning
(1)
Optimization & Theory · Deep Learning
(1)
Systems
(1)
Keywords
communication compression
(7)
distributed optimization
(7)
non-convex optimization
(5)
stochastic optimization
(4)
stochastic gradient
(4)
asynchronous optimization
(4)
communication complexity
(4)
time complexity
(3)
distributed learning
(2)
federated learning
(2)
error feedback
(2)
gradient compression
(2)
gradient descent
(2)
bidirectional compression
(2)
gradient estimation
(1)
decentralized optimization
(1)
perceptron algorithm
(1)
finite-sum optimization
(1)
minimax complexity
(1)
oracle complexity
(1)
Papers
From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes
AAAI 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
Toward a Unified Theory of Gradient Descent under Generalized Smoothness
ICML 2025
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
NeurIPS 2024
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
NeurIPS 2024
On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
NeurIPS 2024
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
NeurIPS 2024
2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression
NeurIPS 2023
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
NeurIPS 2023
DASHA: Distributed Nonconvex Optimization with Communication Compression and Optimal Oracle Complexity
ICLR 2023
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression
ICML 2023
Momentum Provably Improves Error Feedback!
NeurIPS 2023
Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model
NeurIPS 2023
Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
ICLR 2022