Alexander Tiurin
Orcid: 0000-0003-4963-8227
According to our database1,
Alexander Tiurin
authored at least 23 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
1
3
1
3
1
1
4
6
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
CoRR, January, 2025
2024
From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes.
CoRR, 2024
Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics.
CoRR, 2024
On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
2023
Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling.
Trans. Mach. Learn. Res., 2023
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression.
Proceedings of the International Conference on Machine Learning, 2023
DASHA: Distributed Nonconvex Optimization with Communication Compression and Optimal Oracle Complexity.
Proceedings of the Eleventh International Conference on Learning Representations, 2023
2022
DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization.
CoRR, 2022
Modeling and cleaning RNA-seq data significantly improve detection of differentially expressed genes.
BMC Bioinform., 2022
Proceedings of the Tenth International Conference on Learning Representations, 2022
2021
Optim. Methods Softw., 2021
2020
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020
2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
2017
Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method).
CoRR, 2017