default search action
Elnur Gasanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Rafal Szlendak, Elnur Gasanov, Peter Richtárik:
Understanding Progressive Training Through the Framework of Randomized Coordinate Descent. AISTATS 2024: 2161-2169 - [c6]Peter Richtárik, Elnur Gasanov, Konstantin Burlachenko:
Error Feedback Reloaded: From Quadratic to Arithmetic Mean of Smoothness Constants. ICLR 2024 - [i8]Peter Richtárik, Elnur Gasanov, Konstantin Burlachenko:
Error Feedback Reloaded: From Quadratic to Arithmetic Mean of Smoothness Constants. CoRR abs/2402.10774 (2024) - 2023
- [j1]Maksim Makarenko, Elnur Gasanov, Abdurakhmon Sadiev, Rustem Islamov, Peter Richtárik:
Adaptive Compression for Communication-Efficient Distributed Training. Trans. Mach. Learn. Res. 2023 (2023) - [i7]Peter Richtárik, Elnur Gasanov, Konstantin Burlachenko:
Error Feedback Shines when Features are Rare. CoRR abs/2305.15264 (2023) - [i6]Rafal Szlendak, Elnur Gasanov, Peter Richtárik:
Understanding Progressive Training Through the Framework of Randomized Coordinate Descent. CoRR abs/2306.03626 (2023) - 2022
- [c5]Elnur Gasanov, Ahmed Khaled, Samuel Horváth, Peter Richtárik:
FLIX: A Simple and Communication-Efficient Alternative to Local Methods in Federated Learning. AISTATS 2022: 11374-11421 - [c4]Peter Richtárik, Igor Sokolov, Elnur Gasanov, Ilyas Fatkhullin, Zhize Li, Eduard Gorbunov:
3PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregation. ICML 2022: 18596-18648 - [i5]Peter Richtárik
, Igor Sokolov, Ilyas Fatkhullin, Elnur Gasanov, Zhize Li, Eduard Gorbunov:
3PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregation. CoRR abs/2202.00998 (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
- [c3]Dmitry Kovalev, Elnur Gasanov, Alexander V. Gasnikov, Peter Richtárik:
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks. NeurIPS 2021: 22325-22335 - [i3]Dmitry Kovalev
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks. CoRR abs/2106.04469 (2021) - [i2]Elnur Gasanov, Ahmed Khaled, Samuel Horváth
FLIX: A Simple and Communication-Efficient Alternative to Local Methods in Federated Learning. CoRR abs/2111.11556 (2021) - 2020
- [c2]Grigory Malinovskiy, Dmitry Kovalev, Elnur Gasanov, Laurent Condat, Peter Richtárik:
From Local SGD to Local Fixed-Point Methods for Federated Learning. ICML 2020: 6692-6701 - [i1]Grigory Malinovsky, Dmitry Kovalev
From Local SGD to Local Fixed Point Methods for Federated Learning. CoRR abs/2004.01442 (2020)
2010 – 2019
- 2018
- [c1]Dmitry Kovalev, Peter Richtárik, Eduard Gorbunov, Elnur Gasanov:
Stochastic Spectral and Conjugate Descent Methods. NeurIPS 2018: 3362-3371
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-08 19:14 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: