default search action
Ilyas Fatkhullin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Ilyas Fatkhullin, Niao He:
Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence. AISTATS 2024: 3493-3501 - [i11]Ilyas Fatkhullin, Niao He, Yifan Hu:
Stochastic Optimization under Hidden Convexity. CoRR abs/2401.00108 (2024) - [i10]Ilyas Fatkhullin, Niao He:
Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence. CoRR abs/2402.17722 (2024) - [i9]Florian Hübler, Ilyas Fatkhullin, Niao He:
From Gradient Clipping to Normalization for Heavy Tailed SGD. CoRR abs/2410.13849 (2024) - 2023
- [c8]Jiduan Wu, Anas Barakat, Ilyas Fatkhullin, Niao He:
Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity. CDC 2023: 2602-2609 - [c7]Anas Barakat, Ilyas Fatkhullin, Niao He:
Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space. ICML 2023: 1753-1800 - [c6]Ilyas Fatkhullin, Anas Barakat, Anastasia Kireeva, Niao He:
Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies. ICML 2023: 9827-9869 - [c5]Ilyas Fatkhullin, Alexander Tyurin, Peter Richtárik:
Momentum Provably Improves Error Feedback! NeurIPS 2023 - [c4]Junchi Yang, Xiang Li, Ilyas Fatkhullin, Niao He:
Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods. NeurIPS 2023 - [i8]Ilyas Fatkhullin, Anas Barakat, Anastasia Kireeva, Niao He:
Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies. CoRR abs/2302.01734 (2023) - [i7]Junchi Yang, Xiang Li, Ilyas Fatkhullin, Niao He:
Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods. CoRR abs/2305.12475 (2023) - [i6]Ilyas Fatkhullin, Alexander Tyurin, Peter Richtárik:
Momentum Provably Improves Error Feedback! CoRR abs/2305.15155 (2023) - [i5]Anas Barakat, Ilyas Fatkhullin, Niao He:
Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space. CoRR abs/2306.01854 (2023) - [i4]Jiduan Wu, Anas Barakat, Ilyas Fatkhullin
, Niao He:
Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity. CoRR abs/2309.04272 (2023) - 2022
- [c3]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 - [c2]Ilyas Fatkhullin, Jalal Etesami, Niao He, Negar Kiyavash:
Sharp Analysis of Stochastic Optimization under Global Kurdyka-Lojasiewicz Inequality. NeurIPS 2022 - [i3]Peter Richtárik
3PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregation. CoRR abs/2202.00998 (2022) - 2021
- [j1]Ilyas Fatkhullin
Optimizing Static Linear Feedback: Gradient Method. SIAM J. Control. Optim. 59(5): 3887-3911 (2021) - [c1]Peter Richtárik, Igor Sokolov, Ilyas Fatkhullin:
EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback. NeurIPS 2021: 4384-4396 - [i2]Peter Richtárik
EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback. CoRR abs/2106.05203 (2021) - [i1]Ilyas Fatkhullin, Igor Sokolov, Eduard Gorbunov, Zhize Li, Peter Richtárik
EF21 with Bells & Whistles: Practical Algorithmic Extensions of Modern Error Feedback. CoRR abs/2110.03294 (2021)
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-12-01 00:18 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: