Research map / Learning theory and algorithms / Matrix and tensor methods
A Note on Sparse Generalized Eigenvalue Problem
YUNFENG CAI, Guanhua Fang, Ping Li
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 |
|---|---|---|---|
| Increase sample size n from 100 to 6400 | NC-SGEP · Synthetic |S|=2 | estimation error: 0.140 -> 0.008 | Improved |
| Increase sample size n from 100 to 6400 | NC-SGEP · Synthetic |S|=8 | estimation error: 0.277 -> 0.028 | Improved |
| Increase support size |S| from 2 to 8 | NC-SGEP · Synthetic n=1600 | estimation error: 0.019 -> 0.058 | Hurt |
| Unknown support (Est) versus known support (Oracle) | NC-SGEP · Synthetic |S|=2, n=100 | estimation error: 0.056 -> 0.140 | Hurt |
| Unknown support versus Oracle at large n | NC-SGEP · Synthetic |S|=2, n=6400 | estimation error: 0.007 -> 0.008 | No clear effect |
| Unknown support versus Oracle with small n and large support | NC-SGEP · Synthetic |S|=8, n=100 | estimation error: 0.173 -> 0.277 | Hurt |
| NC-SGEP instead of SDP_L1 | NC-SGEP · Sparse CCA p=256 | ||x_hat x_hat^T - u1 u1^T||_inf: 0.100 -> 0.084 | Improved |
| NC-SGEP instead of SDP_MCP | NC-SGEP · Sparse CCA p=256 | ||x_hat x_hat^T - u1 u1^T||_inf: 0.096 -> 0.084 | Improved |
| NC-SGEP instead of SDP_L1 | NC-SGEP · Sparse CCA p=16 | ||x_hat x_hat^T - u1 u1^T||_inf: 0.071 -> 0.074 | No clear effect |
| Increase dimension p from 16 to 256 | NC-SGEP · Sparse CCA | recovery of |S|: 93 % -> 49 % | Hurt |
| NC-SGEP versus SDP methods for support recovery | NC-SGEP · Sparse CCA | recovery of |S| | Improved |
Closest papers by meaning
- A Decomposition Algorithm for the Sparse Generalized Eigenvalue Problem (CVPR 2019 · similarity 0.90)
- Generalized Eigenvalue Problems with Generative Priors (NeurIPS 2024 · similarity 0.87)
- Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression (NeurIPS 2018 · similarity 0.86)
- The Symmetric Generalized Eigenvalue Problem as a Nash Equilibrium (ICLR 2023 · similarity 0.86)
- Scalable First-order Method for Certifying Optimal k-Sparse GLMs (ICML 2025 · similarity 0.85)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.84)
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.
