| EF21-P and friends: Improved theoretical communication complexity for distributed optimization with bidirectional compression K Gruntkowska, A Tyurin, P Richtárik International Conference on Machine Learning, 11761-11807, 2023 | 30 | 2023 |
| Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity K Gruntkowska, A Tyurin, P Richtárik arXiv preprint arXiv:2402.06412, 2024 | 5 | 2024 |
| Communication compression for byzantine robust learning: New efficient algorithms and improved rates A Rammal, K Gruntkowska, N Fedin, E Gorbunov, P Richtárik International Conference on Artificial Intelligence and Statistics, 1207-1215, 2024 | 4 | 2024 |
| Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations A Tyurin, K Gruntkowska, P Richtárik arXiv preprint arXiv:2405.15545, 2024 | 3 | 2024 |
| Tighter performance theory of FedExProx W Anyszka, K Gruntkowska, A Tyurin, P Richtárik arXiv preprint arXiv:2410.15368, 2024 | 1 | 2024 |
| The Ball-Proximal (=" Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications K Gruntkowska, H Li, A Rane, P Richtárik arXiv preprint arXiv:2502.02002, 2025 | | 2025 |
Peter RichtarikProfessor, KAUSTVerified email at kaust.edu.sa