default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnastasia Koloskova
Person information
- affiliation: EPFL, Lausanne, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Mathieu Even, Anastasia Koloskova, Laurent Massoulié:
Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization. AISTATS 2024: 64-72- [c14]Youssef Allouah, Anastasia Koloskova, Aymane El Firdoussi, Martin Jaggi, Rachid Guerraoui:
The Privacy Power of Correlated Noise in Decentralized Learning. ICML 2024 - [c13]Anastasia Koloskova, Nikita Doikov, Sebastian U. Stich, Martin Jaggi:
On Convergence of Incremental Gradient for Non-convex Smooth Functions. ICML 2024 - [i17]Youssef Allouah, Anastasia Koloskova, Aymane El Firdoussi, Martin Jaggi, Rachid Guerraoui:
The Privacy Power of Correlated Noise in Decentralized Learning. CoRR abs/2405.01031 (2024) - 2023
- [c12]Anastasia Koloskova, Hadrien Hendrikx, Sebastian U. Stich:
Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees. ICML 2023: 17343-17363 - [c11]Anastasia Koloskova, Ryan McKenna, Zachary Charles, John Keith Rush, H. Brendan McMahan:
Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacy. NeurIPS 2023 - [i16]Yue Liu, Tao Lin, Anastasia Koloskova, Sebastian U. Stich:
Decentralized Gradient Tracking with Local Steps. CoRR abs/2301.01313 (2023) - [i15]Anastasia Koloskova, Ryan McKenna, Zachary Charles, Keith Rush, Brendan McMahan:
Convergence of Gradient Descent with Linearly Correlated Noise and Applications to Differentially Private Learning. CoRR abs/2302.01463 (2023) - [i14]Anastasia Koloskova, Hadrien Hendrikx, Sebastian U. Stich:
Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees. CoRR abs/2305.01588 (2023) - [i13]Anastasia Koloskova, Nikita Doikov, Sebastian U. Stich, Martin Jaggi:
Shuffle SGD is Always Better than SGD: Improved Analysis of SGD with Arbitrary Data Orders. CoRR abs/2305.19259 (2023) - [i12]Mathieu Even, Anastasia Koloskova, Laurent Massoulié:
Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization. CoRR abs/2311.00465 (2023) - 2022
- [c10]Aleksandr Beznosikov, Pavel E. Dvurechensky, Anastasia Koloskova, Valentin Samokhin, Sebastian U. Stich, Alexander V. Gasnikov:
Decentralized Local Stochastic Extra-Gradient for Variational Inequalities. NeurIPS 2022 - [c9]Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning. NeurIPS 2022 - [i11]Anastasia Koloskova, Tao Lin, Sebastian U. Stich:
An Improved Analysis of Gradient Tracking for Decentralized Machine Learning. CoRR abs/2202.03836 (2022) - [i10]Yatin Dandi, Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich:
Data-heterogeneity-aware Mixing for Decentralized Learning. CoRR abs/2204.06477 (2022) - [i9]Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning. CoRR abs/2206.08307 (2022) - 2021
- [c8]Dmitry Kovalev, Anastasia Koloskova, Martin Jaggi, Peter Richtárik, Sebastian U. Stich:
A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free! AISTATS 2021: 4087-4095 - [c7]Lingjing Kong, Tao Lin, Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich:
Consensus Control for Decentralized Deep Learning. ICML 2021: 5686-5696 - [c6]Anastasia Koloskova, Tao Lin, Sebastian U. Stich:
An Improved Analysis of Gradient Tracking for Decentralized Machine Learning. NeurIPS 2021: 11422-11435 - [c5]Thijs Vogels, Lie He, Anastasia Koloskova, Sai Praneeth Karimireddy, Tao Lin, Sebastian U. Stich, Martin Jaggi:
RelaySum for Decentralized Deep Learning on Heterogeneous Data. NeurIPS 2021: 28004-28015 - [i8]Lingjing Kong, Tao Lin, Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich:
Consensus Control for Decentralized Deep Learning. CoRR abs/2102.04828 (2021) - [i7]Aleksandr Beznosikov, Pavel E. Dvurechensky, Anastasia Koloskova, Valentin Samokhin, Sebastian U. Stich, Alexander V. Gasnikov:
Decentralized Local Stochastic Extra-Gradient for Variational Inequalities. CoRR abs/2106.08315 (2021) - [i6]Thijs Vogels, Lie He, Anastasia Koloskova, Tao Lin, Sai Praneeth Karimireddy, Sebastian U. Stich, Martin Jaggi:
RelaySum for Decentralized Deep Learning on Heterogeneous Data. CoRR abs/2110.04175 (2021) - 2020
- [c4]Anastasia Koloskova, Tao Lin
, Sebastian U. Stich, Martin Jaggi:
Decentralized Deep Learning with Arbitrary Communication Compression. ICLR 2020 - [c3]Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, Sebastian U. Stich:
A Unified Theory of Decentralized SGD with Changing Topology and Local Updates. ICML 2020: 5381-5393 - [i5]Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, Sebastian U. Stich:
A Unified Theory of Decentralized SGD with Changing Topology and Local Updates. CoRR abs/2003.10422 (2020) - [i4]Dmitry Kovalev, Anastasia Koloskova, Martin Jaggi, Peter Richtárik, Sebastian U. Stich:
A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free! CoRR abs/2011.01697 (2020)
2010 – 2019
- 2019
- [c2]Sai Praneeth Karimireddy, Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Efficient Greedy Coordinate Descent for Composite Problems. AISTATS 2019: 2887-2896 - [c1]Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication. ICML 2019: 3478-3487 - [i3]Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication. CoRR abs/1902.00340 (2019) - [i2]Anastasia Koloskova, Tao Lin, Sebastian U. Stich, Martin Jaggi:
Decentralized Deep Learning with Arbitrary Communication Compression. CoRR abs/1907.09356 (2019) - 2018
- [i1]Sai Praneeth Karimireddy, Anastasia Koloskova, Sebastian U. Stich, Martin Jaggi:
Efficient Greedy Coordinate Descent for Composite Problems. CoRR abs/1810.06999 (2018)
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-09-04 00: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:
