Distributed Estimation of Principal Eigenspaces

Abstract

Principal component analysis (PCA) is fundamental to statistical machine learning. It extracts latent principal factors that contribute to the most variation of the data. When data are stored across multiple machines, however, communication cost can prohibit the computation of PCA in a central location and distributed algorithms for PCA are thus needed. This paper proposes and studies a distributed PCA algorithm: each node machine computes the top $K$ eigenvectors and transmits them to the central server; the central server then aggregates the information from all the node machines and conducts a PCA based on the aggregated information. We investigate the bias and variance for the resulting distributed estimator of the top $K$ eigenvectors. In particular, we show that for distributions with symmetric innovation, the empirical top eigenspaces are unbiased and hence the distributed PCA is "unbiased". We derive the rate of convergence for distributed PCA estimators, which depends explicitly on the effective rank of covariance, eigen-gap, and the number of machines. We show that when the number of machines is not unreasonably large, the distributed PCA performs as well as the whole sample PCA, even without full access of whole data. The theoretical results are verified by an extensive simulation study. We also extend our analysis to the heterogeneous case where the population covariance matrices are different across local machines but share similar top eigen-structures.

47 pages

References in corpus (5)

• Augmented sparse principal component analysis for high dimensional data
• Improved Distributed Principal Component Analysis
• Estimation of the covariance structure of heavy-tailed distributions
• Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis
• Analyzing the structure of multidimensional compressed sensing problems through coherence

Cited by in corpus (10)

• Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
• Entrywise Eigenvector Analysis of Random Matrices with Low Expected Rank
• Distributed Inference for Linear Support Vector Machine
• Principal component analysis for big data
• Distributed linear regression by averaging
• Integrated Principal Components Analysis
• Optimal Subspace Estimation Using Overidentifying Vectors via Generalized Method of Moments
• Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis
• Distributed Nonparametric Regression under Communication Constraints
• Simultaneous Inference for Massive Data: Distributed Bootstrap