Research map / Learning theory and algorithms / Matrix and tensor methods
A Simple and Provable Algorithm for Sparse Diagonal CCA
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use SpanCCA instead of PMD at matched target sparsity | Sparse diagonal CCA on breast cancer DNA-RNA data · Breast cancer DNA-RNA | objective value | Helped |
| Use SpanCCA instead of PMD | Sparse diagonal CCA on breast cancer DNA-RNA data · Breast cancer DNA-RNA | runtime | Helped |
| Run independent sampling iterations across worker processes | SpanCCA on HCP brain imaging and behavioral data · HCP 2back - 0back | speedup | Helped |
Closest papers by meaning
- On Sparse Canonical Correlation Analysis (NeurIPS 2024 · similarity 0.93)
- L0-Sparse Canonical Correlation Analysis (ICLR 2022 · similarity 0.92)
- Unconstrained Stochastic CCA: Unifying Multiview and Self-Supervised Learning (ICLR 2024 · similarity 0.88)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.87)
- Unpaired Canonical Correlation Analysis (NeurIPS 2026 · similarity 0.85)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (ICML 2025 · similarity 0.85)
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.