Communication-Efficient Distributed SVD via Local Power Iterations

Abstract

We study distributed computing of the truncated singular value decomposition problem. We develop an algorithm that we call \texttt{LocalPower} for improving communication efficiency. Specifically, we uniformly partition the dataset among $m$ nodes and alternate between multiple (precisely $p$) local power iterations and one global aggregation. In the aggregation, we propose to weight each local eigenvector matrix with orthogonal Procrustes transformation (OPT). As a practical surrogate of OPT, sign-fixing, which uses a diagonal matrix with $\pm 1$ entries as weights, has better computation complexity and stability in experiments. We theoretically show that under certain assumptions \texttt{LocalPower} lowers the required number of communications by a factor of $p$ to reach a constant accuracy. We also show that the strategy of periodically decaying $p$ helps obtain high-precision solutions. We conduct experiments to demonstrate the effectiveness of \texttt{LocalPower}.

9 pages, 7 figures, accepted by 2021 ICML

References in corpus (11)

• FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization
• Local SGD Converges Fast and Communicates Little
• Cooperative SGD: A unified Framework for the Design and Analysis of Communication-Efficient SGD Algorithms
• Optimal Client Sampling for Federated Learning
• First Analysis of Local GD on Heterogeneous Data
• Improved Distributed Principal Component Analysis
• Adaptive Communication Strategies to Achieve the Best Error-Runtime Trade-off in Local-Update SGD
• Federated Principal Component Analysis
• Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis
• Distributed Stochastic Algorithms for High-rate Streaming Principal Component Analysis
• FedPower: Privacy-Preserving Distributed Eigenspace Estimation

Cited by in corpus (1)

• FedPower: Privacy-Preserving Distributed Eigenspace Estimation