default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrigory Malinovsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Soumia Boucherouite, Grigory Malinovsky, Peter Richtárik
, El Houcine Bergou:
Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization. AAAI 2024: 20344-20352- [i19]Yury Demidovich, Grigory Malinovsky, Peter Richtárik:
Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction. CoRR abs/2403.06677 (2024) - [i18]Ionut-Vlad Modoranu, Mher Safaryan, Grigory Malinovsky, Eldar Kurtic, Thomas Robert, Peter Richtárik, Dan Alistarh:
MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence. CoRR abs/2405.15593 (2024) - 2023
- [c7]Michal Grudzien, Grigory Malinovsky, Peter Richtárik:
Can 5th Generation Local Training Methods Support Client Sampling? Yes! AISTATS 2023: 1055-1092 - [c6]Grigory Malinovsky, Konstantin Mishchenko, Peter Richtárik:
Server-Side Stepsizes and Sampling Without Replacement Provably Help in Federated Optimization. DistributedML@CoNEXT 2023: 85-104 - [c5]Yury Demidovich, Grigory Malinovsky, Igor Sokolov, Peter Richtárik:
A Guide Through the Zoo of Biased SGD. NeurIPS 2023 - [c4]Grigory Malinovsky, Alibek Sailanbayev, Peter Richtárik:
Random Reshuffling with Variance Reduction: New Analysis and Better Rates. UAI 2023: 1347-1357 - [i17]Grigory Malinovsky, Samuel Horváth, Konstantin Burlachenko, Peter Richtárik:
Federated Learning with Regularized Client Participation. CoRR abs/2302.03662 (2023) - [i16]Laurent Condat, Grigory Malinovsky, Peter Richtárik:
TAMUNA: Accelerated Federated Learning with Local Training and Partial Participation. CoRR abs/2302.09832 (2023) - [i15]Yury Demidovich, Grigory Malinovsky, Igor Sokolov, Peter Richtárik:
A Guide Through the Zoo of Biased SGD. CoRR abs/2305.16296 (2023) - [i14]Michal Grudzien, Grigory Malinovsky, Peter Richtárik:
Improving Accelerated Federated Learning with Compression and Importance Sampling. CoRR abs/2306.03240 (2023) - [i13]Grigory Malinovsky, Peter Richtárik, Samuel Horváth, Eduard Gorbunov:
Byzantine Robustness and Partial Participation Can Be Achieved Simultaneously: Just Clip Gradient Differences. CoRR abs/2311.14127 (2023) - [i12]Yury Demidovich, Grigory Malinovsky, Egor Shulgin, Peter Richtárik:
MAST: Model-Agnostic Sparsified Training. CoRR abs/2311.16086 (2023) - 2022
- [c3]Konstantin Mishchenko, Grigory Malinovsky, Sebastian U. Stich, Peter Richtárik:
ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally! ICML 2022: 15750-15769 - [c2]Grigory Malinovsky, Kai Yi, Peter Richtárik:
Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning. NeurIPS 2022 - [i11]Grigory Malinovsky, Konstantin Mishchenko, Peter Richtárik:
Server-Side Stepsizes and Sampling Without Replacement Provably Help in Federated Optimization. CoRR abs/2201.11066 (2022) - [i10]Konstantin Mishchenko, Grigory Malinovsky, Sebastian U. Stich, Peter Richtárik:
ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally! CoRR abs/2202.09357 (2022) - [i9]Grigory Malinovsky, Peter Richtárik:
Federated Random Reshuffling with Compression and Variance Reduction. CoRR abs/2205.03914 (2022) - [i8]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) - [i7]Grigory Malinovsky, Kai Yi, Peter Richtárik:
Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning. CoRR abs/2207.04338 (2022) - [i6]Soumia Boucherouite, Grigory Malinovsky, Peter Richtárik, El Houcine Bergou:
Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization. CoRR abs/2209.07883 (2022) - [i5]Michal Grudzien, Grigory Malinovsky, Peter Richtárik:
Can 5th Generation Local Training Methods Support Client Sampling? Yes! CoRR abs/2212.14370 (2022) - [i4]Dmitry Kovalev, Alexander V. Gasnikov, Grigory Malinovsky:
An Optimal Algorithm for Strongly Convex Min-min Optimization. CoRR abs/2212.14439 (2022) - 2021
- [i3]Grigory Malinovsky, Alibek Sailanbayev, Peter Richtárik:
Random Reshuffling with Variance Reduction: New Analysis and Better Rates. CoRR abs/2104.09342 (2021) - 2020
- [c1]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 - [i2]Grigory Malinovsky, Dmitry Kovalev, Elnur Gasanov, Laurent Condat, Peter Richtárik:
From Local SGD to Local Fixed Point Methods for Federated Learning. CoRR abs/2004.01442 (2020) - [i1]Laurent Condat, Grigory Malinovsky, Peter Richtárik:
Distributed Proximal Splitting Algorithms with Rates and Acceleration. CoRR abs/2010.00952 (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-06-26 20:27 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:
