Picture for Alexander Tyurin

Alexander Tyurin

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

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity

Feb 07, 2024
Figure 1 for Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
Figure 2 for Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
Figure 3 for Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
Figure 4 for Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
Viaarxiv icon

Momentum Provably Improves Error Feedback!

May 24, 2023
Figure 1 for Momentum Provably Improves Error Feedback!
Figure 2 for Momentum Provably Improves Error Feedback!
Figure 3 for Momentum Provably Improves Error Feedback!
Figure 4 for Momentum Provably Improves Error Feedback!
Viaarxiv icon

Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling

Add code
Jun 05, 2022
Figure 1 for Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling
Figure 2 for Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling
Figure 3 for Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling
Figure 4 for Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling
Viaarxiv icon

A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting

Add code
May 31, 2022
Figure 1 for A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
Viaarxiv icon

DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization

Add code
Feb 02, 2022
Figure 1 for DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization
Figure 2 for DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization
Figure 3 for DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization
Figure 4 for DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization
Viaarxiv icon

Permutation Compressors for Provably Faster Distributed Nonconvex Optimization

Oct 07, 2021
Figure 1 for Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
Figure 2 for Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
Figure 3 for Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
Figure 4 for Permutation Compressors for Provably Faster Distributed Nonconvex Optimization
Viaarxiv icon