Efficient Distributed Estimation of Inverse Covariance Matrices
arXiv:1605.00758 · doi:10.1109/SSP.2016.7551705
Abstract
In distributed systems, communication is a major concern due to issues such as its vulnerability or efficiency. In this paper, we are interested in estimating sparse inverse covariance matrices when samples are distributed into different machines. We address communication efficiency by proposing a method where, in a single round of communication, each machine transfers a small subset of the entries of the inverse covariance matrix. We show that, with this efficient distributed method, the error rates can be comparable with estimation in a non-distributed setting, and correct model selection is still possible. Practical performance is shown through simulations.
References in corpus (7)
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Sparse permutation invariant covariance estimation
- The huge Package for High-dimensional Undirected Graph Estimation in R
- Confidence intervals for high-dimensional inverse covariance estimation
- Communication-efficient sparse regression: a one-shot approach
- Marginal Likelihoods for Distributed Parameter Estimation of Gaussian Graphical Models