Search Results for author:
Found 2 papers, 1 papers with code
Correlated Quantization for Faster Nonconvex Distributed Optimization
We analyze the forefront distributed non-convex optimization algorithm MARINA (Gorbunov et al., 2022) utilizing the proposed correlated quantizers and show that it outperforms the original MARINA and distributed SGD of Suresh et al. (2022) with regard to the communication complexity.
Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
Byzantine robustness is an essential feature of algorithms for certain distributed optimization problems, typically encountered in collaborative/federated learning.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
