Communication-efficient distributed covariance sketch, with application to distributed PCA
- Publisher:
- Microtome Publishing
- Publication Type:
- Journal Article
- Citation:
- Journal of Machine Learning Research, 2021, 22, pp. 1-35
- Issue Date:
- 2021-01-01
Open Access
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
A sketch of a large data set captures vital properties of the original data while typically occupying much less space. In this paper, we consider the problem of computing a sketch of a massive data matrix A ∈ Rn×d that is distributed across s machines. Our goal is to output a matrix B ∈ Rℓ×d which is significantly smaller than but still approximates A well in terms of covariance error, i.e., kAT A - BT Bk2. Such a matrix B is called a covariance sketch of A. We are mainly focused on minimizing the communication cost, which is arguably the most valuable resource in distributed computations. We show that there is a nontrivial gap between deterministic and randomized communication complexity for computing a covariance sketch. More specifically, we first prove an almost tight deterministic communication lower bound, then provide a new randomized algorithm with communication cost smaller than the deterministic lower bound. Based on a well-known connection between covariance sketch and approximate principle component analysis, we obtain better communication bounds for the distributed PCA problem. Moreover, we also give an improved distributed PCA algorithm for sparse input matrices, which uses our distributed sketching algorithm as a key building block.
Please use this identifier to cite or link to this item: