default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdurakhmon Sadiev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Abdurakhmon Sadiev, Aleksandr Beznosikov
, Abdulla Jasem Almansoori, Dmitry Kamzolov, Rachael Tappenden, Martin Takác:
Stochastic Gradient Methods with Preconditioned Updates. J. Optim. Theory Appl. 201(2): 471-489 (2024)- 2023
- [j3]Maksim Makarenko, Elnur Gasanov, Abdurakhmon Sadiev, Rustem Islamov, Peter Richtárik:
Adaptive Compression for Communication-Efficient Distributed Training. Trans. Mach. Learn. Res. 2023 (2023) - [j2]Zheng Shi, Abdurakhmon Sadiev, Nicolas Loizou, Peter Richtárik, Martin Takác:
AI-SARAH: Adaptive and Implicit Stochastic Recursive Gradient Methods. Trans. Mach. Learn. Res. 2023 (2023) - 2022
- [j1]Abdurakhmon Sadiev, Ekaterina Borodich, Aleksandr Beznosikov, Darina Dvinskikh, Saveliy Chezhegov, Rachael Tappenden, Martin Takác, Alexander V. Gasnikov:
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes. EURO J. Comput. Optim. 10: 100041 (2022)
Conference and Workshop Papers
- 2024
- [c4]Eduard Gorbunov, Abdurakhmon Sadiev, Marina Danilova, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise. ICML 2024 - 2023
- [c3]Abdurakhmon Sadiev, Marina Danilova, Eduard Gorbunov, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance. ICML 2023: 29563-29648 - 2022
- [c2]Dmitry Kovalev, Aleksandr Beznosikov, Abdurakhmon Sadiev, Michael Persiianov, Peter Richtárik, Alexander V. Gasnikov:
Optimal Algorithms for Decentralized Stochastic Variational Inequalities. NeurIPS 2022 - [c1]Abdurakhmon Sadiev, Dmitry Kovalev, Peter Richtárik:
Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with an Inexact Prox. NeurIPS 2022
Informal and Other Publications
- 2024
- [i13]Peter Richtárik, Abdurakhmon Sadiev, Yury Demidovich:
A Unified Theory of Stochastic Proximal Point Methods without Smoothness. CoRR abs/2405.15941 (2024) - [i12]Avetik G. Karagulyan, Egor Shulgin, Abdurakhmon Sadiev, Peter Richtárik:
SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning. CoRR abs/2405.20127 (2024) - [i11]Sarit Khirirat, Abdurakhmon Sadiev, Artem Riabinin, Eduard Gorbunov, Peter Richtárik:
Error Feedback under (L0,L1)-Smoothness: Normalization and Momentum. CoRR abs/2410.16871 (2024) - 2023
- [i10]Abdurakhmon Sadiev, Marina Danilova, Eduard Gorbunov, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance. CoRR abs/2302.00999 (2023) - [i9]Eduard Gorbunov, Abdurakhmon Sadiev, Marina Danilova, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise. CoRR abs/2310.01860 (2023) - 2022
- [i8]Dmitry Kovalev, Aleksandr Beznosikov, Abdurakhmon Sadiev, Michael Persiianov, Peter Richtárik, Alexander V. Gasnikov:
Optimal Algorithms for Decentralized Stochastic Variational Inequalities. CoRR abs/2202.02771 (2022) - [i7]Abdurakhmon Sadiev, Aleksandr Beznosikov, Abdulla Jasem Almansoori, Dmitry Kamzolov, Rachael Tappenden, Martin Takác:
Stochastic Gradient Methods with Preconditioned Updates. CoRR abs/2206.00285 (2022) - [i6]Abdurakhmon Sadiev, Grigory Malinovsky, Eduard Gorbunov, Igor Sokolov, Ahmed Khaled, Konstantin Burlachenko, Peter Richtárik:
Federated Optimization Algorithms with Random Reshuffling and Gradient Compression. CoRR abs/2206.07021 (2022) - [i5]Abdurakhmon Sadiev, Dmitry Kovalev, Peter Richtárik:
Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with Inexact Prox. CoRR abs/2207.03957 (2022) - [i4]Maksim Makarenko, Elnur Gasanov, Rustem Islamov, Abdurakhmon Sadiev, Peter Richtárik:
Adaptive Compression for Communication-Efficient Distributed Training. CoRR abs/2211.00188 (2022) - 2021
- [i3]Aleksandr Beznosikov, Vadim Sushko, Abdurakhmon Sadiev, Alexander V. Gasnikov:
Decentralized Personalized Federated Min-Max Problems. CoRR abs/2106.07289 (2021) - 2020
- [i2]Aleksandr Beznosikov, Abdurakhmon Sadiev, Alexander V. Gasnikov:
Gradient-Free Methods for Saddle-Point Problem. CoRR abs/2005.05913 (2020) - [i1]Abdurakhmon Sadiev, Aleksandr Beznosikov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Zeroth-Order Algorithms for Smooth Saddle-Point Problems. CoRR abs/2009.09908 (2020)
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-11-28 21:23 CET 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:
