Research map / Learning theory and algorithms / Matrix and tensor methods
On Distributed Averaging for Stochastic k-PCA
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis (ICML 2017 · similarity 0.91)
- Exponentially convergent stochastic k-PCA without variance reduction (NeurIPS 2019 · similarity 0.88)
- Improved Analysis of the Accelerated Noisy Power Method with Applications to Decentralized PCA (ICML 2026 · similarity 0.86)
- An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise (NeurIPS 2025 · similarity 0.85)
- Oja's Algorithm for Streaming Sparse PCA (NeurIPS 2024 · similarity 0.84)
- A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging (NeurIPS 2025 · similarity 0.83)
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.
