Dimension Reduction for Large-Scale Federated Data: Statistical Rate and Asymptotic Inference
From MaRDI portal
Cites work
- Asymptotic Theory for Principal Component Analysis
- Asymptotics of empirical eigenstructure for high dimensional spiked covariance
- Asymptotics of sample eigenstructure for a large dimensional spiked covariance model
- Communication-efficient distributed statistical inference
- Community detection and stochastic block models: recent developments
- Distributed clustering using collective principal component analysis
- Distributed estimation of principal eigenspaces
- Entrywise eigenvector analysis of random matrices with low expected rank
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- How to Reduce Dimension With PCA and Random Projections?
- Inference and uncertainty quantification for noisy matrix completion
- On the distribution of the largest eigenvalue in principal components analysis
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
- Simple: Statistical Inference on Membership Profiles in Large Networks
This page was built for publication: Dimension Reduction for Large-Scale Federated Data: Statistical Rate and Asymptotic Inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231180)