Communication-efficient distributed covariance sketch, with application to distributed PCA
From MaRDI portal
Recommendations
- Optimal principal component analysis in distributed and streaming models
- Distributed estimation of principal eigenspaces
- Communication-Efficient Distributed Eigenspace Estimation
- Robust covariance estimation for distributed principal component analysis
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
Cites work
- Communication Complexity
- Concentration of Measure for the Analysis of Randomized Algorithms
- Determinantal point processes in randomized numerical linear algebra
- Distributed streams algorithms for sliding windows
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Faster least squares approximation
- Finding repeated elements
- Frequent directions: simple and deterministic matrix sketching
- scientific article; zbMATH DE number 7049775 (Why is no real title available?)
- Improved practical matrix sketching with guarantees
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Mergeable summaries
- Numerical linear algebra in the streaming model
- Online principal components analysis
- Optimal principal component analysis in distributed and streaming models
- Relative errors for deterministic low-rank matrix approximations
- Robust frequent directions with application in online learning
- Spectral norm of products of random and deterministic matrices
- Sums of random Hermitian matrices and an inequality by Rudelson
- The Communication Complexity of Distributed epsilon-Approximations
- Tighter low-rank approximation via sampling the leveraged element
- Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
- User-friendly tail bounds for sums of random matrices
Cited in
(5)- Communication-Efficient Distributed Eigenspace Estimation
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- Distributed Tensor Principal Component Analysis with Data Heterogeneity
- Distributed empirical likelihood inference with or without Byzantine failures
- Distributed optimization for penalized regression in massive compositional data
This page was built for publication: Communication-efficient distributed covariance sketch, with application to distributed PCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999000)
