default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Tiurin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Alexander Tyurin, Marta Pozzi, Ivan Ilin, Peter Richtárik:
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity. CoRR abs/2402.04785 (2024)- [i9]Kaja Gruntkowska, Alexander Tyurin, Peter Richtárik:
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity. CoRR abs/2402.06412 (2024) - [i8]Alexander Tyurin, Kaja Gruntkowska, Peter Richtárik:
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations. CoRR abs/2405.15545 (2024) - 2023
- [j4]Alexander Tyurin, Lukang Sun, Konstantin Burlachenko, Peter Richtárik:
Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling. Trans. Mach. Learn. Res. 2023 (2023) - [c9]Alexander Tyurin, Peter Richtárik:
DASHA: Distributed Nonconvex Optimization with Communication Compression and Optimal Oracle Complexity. ICLR 2023 - [c8]Kaja Gruntkowska, Alexander Tyurin, Peter Richtárik:
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression. ICML 2023: 11761-11807 - [c7]Ilyas Fatkhullin, Alexander Tyurin, Peter Richtárik:
Momentum Provably Improves Error Feedback! NeurIPS 2023 - [c6]Alexander Tyurin, Peter Richtárik:
2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression. NeurIPS 2023 - [c5]Alexander Tyurin, Peter Richtárik:
Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model. NeurIPS 2023 - [c4]Alexander Tyurin, Peter Richtárik:
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting. NeurIPS 2023 - [i7]Ilyas Fatkhullin, Alexander Tyurin, Peter Richtárik:
Momentum Provably Improves Error Feedback! CoRR abs/2305.15155 (2023) - 2022
- [j3]Igor V. Deyneko
, Orkhan N. Mustafaev, Alexander Tyurin, Ksenya V. Zhukova, Alexander Varzari, Irina V. Goldenkova-Pavlova:
Modeling and cleaning RNA-seq data significantly improve detection of differentially expressed genes. BMC Bioinform. 23(1): 488 (2022) - [j2]Anastasiya Ivanova, Pavel E. Dvurechensky, Evgeniya A. Vorontsova, Dmitry Pasechnyuk, Alexander V. Gasnikov, Darina Dvinskikh, Alexander Tyurin:
Oracle Complexity Separation in Convex Optimization. J. Optim. Theory Appl. 193(1): 462-490 (2022) - [c3]Rafal Szlendak, Alexander Tyurin, Peter Richtárik:
Permutation Compressors for Provably Faster Distributed Nonconvex Optimization. ICLR 2022 - [i6]Alexander Tyurin, Peter Richtárik:
DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization. CoRR abs/2202.01268 (2022) - [i5]Alexander Tyurin, Peter Richtárik:
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting. CoRR abs/2205.15580 (2022) - [i4]Alexander Tyurin, Lukang Sun, Konstantin Burlachenko, Peter Richtárik:
Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling. CoRR abs/2206.02275 (2022) - [i3]Kaja Gruntkowska, Alexander Tyurin, Peter Richtárik:
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression. CoRR abs/2209.15218 (2022) - 2021
- [j1]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:
Inexact model: a framework for optimization and variational inequalities. Optim. Methods Softw. 36(6): 1155-1201 (2021) - [i2]Rafal Szlendak, Alexander Tyurin, Peter Richtárik:
Permutation Compressors for Provably Faster Distributed Nonconvex Optimization. CoRR abs/2110.03300 (2021) - 2020
- [c2]Pavel E. Dvurechensky, Alexander V. Gasnikov, Sergey Omelchenko, Alexander Tiurin:
A Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport. MOTOR 2020: 406-423
2010 – 2019
- 2019
- [c1]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:
Gradient Methods for Problems with Inexact Model of the Objective. MOTOR 2019: 97-114 - 2017
- [i1]Pavel E. Dvurechensky, Alexander V. Gasnikov, Alexander Tiurin:
Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method). CoRR abs/1707.08486 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-02 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
