Research map / Optimization / Distributed and compressed
DeEPCA: Decentralized Exact PCA with Linear Convergence Rate
Haishan Ye, Tong Zhang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use K=3 consensus steps per power iteration (too few) (ablation) | DeEPCA · w8a and a9a | convergence to top-k principal components | Hurt |
| use sufficient consensus steps K (ablation) | DeEPCA · w8a and a9a | convergence rate | Improved |
| add subspace tracking (DeEPCA instead of DePCA) | decentralized power method · w8a and a9a | communication cost / convergence | Improved |
Closest papers by meaning
- Improved Analysis of the Accelerated Noisy Power Method with Applications to Decentralized PCA (ICML 2026 · similarity 0.88)
- A Decentralized Framework for Kernel PCA With Projection Consensus Constraints (TPAMI 2025 · similarity 0.86)
- Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis (ICML 2017 · similarity 0.85)
- Communication-Efficient Distributed PCA by Riemannian Optimization (ICML 2020 · similarity 0.84)
- EigenGame: PCA as a Nash Equilibrium (ICLR 2021 · similarity 0.84)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
