Research map / Optimization / Nonconvex and smooth optimization
Stochastic Approximation for Canonical Correlation Analysis
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 capped MSG-CCA instead of the compared CCA methods | CCA on Mediamill · Mediamill | runtime to reach an ε-suboptimal solution | Helped |
| Use CCALin or ALS CCA instead of capped MSG-CCA or MEG-CCA | CCA on Mediamill, k = 1 · Mediamill | objective progress per iteration | Helped |
| Cap the rank of MSG-CCA iterates (ablation) | MSG-CCA · Mediamill | convergence | No clear effect |
Closest papers by meaning
- Efficient Globally Convergent Stochastic Optimization for Canonical Correlation Analysis (NeurIPS 2016 · similarity 0.92)
- An Online Riemannian PCA for Stochastic Canonical Correlation Analysis (NeurIPS 2021 · similarity 0.89)
- Unconstrained Stochastic CCA: Unifying Multiview and Self-Supervised Learning (ICLR 2024 · similarity 0.89)
- On Sparse Canonical Correlation Analysis (NeurIPS 2024 · similarity 0.86)
- The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize (NeurIPS 2024 · similarity 0.83)
- How Accurately Can a Gaussian Approximate Stochastic Approximation Iterates? (NeurIPS 2026 · 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.