Picture for Kaja Gruntkowska

Kaja Gruntkowska

Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations

May 24, 2024
Viaarxiv icon

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity

Feb 09, 2024
Figure 1 for Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
Figure 2 for Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
Figure 3 for Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
Figure 4 for Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
Viaarxiv icon

Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates

Oct 15, 2023
Figure 1 for Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
Figure 2 for Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
Figure 3 for Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
Figure 4 for Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
Viaarxiv icon