Research map / Learning theory and algorithms / Matrix and tensor methods
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data
Yining Wang, Aarti Singh
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 iterative norm sampling instead of norm sampling | column subset selection with missing entries · Lena image (50 columns, alpha=0.3) | relative selection error: 0.106 -> 0.088 | Improved |
| use approximate leverage score sampling instead of norm sampling | column subset selection with missing entries · Lena image (50 columns, alpha=0.3) | relative selection error: 0.106 -> 0.103 | Improved |
| use iterative norm sampling or leverage score sampling instead of block OMP on coherent-column matrices | Block OMP · synthetic matrices with coherent columns | selection error | Improved |
| sample without replacement instead of with replacement (ablation) | norm and leverage score sampling · synthetic Gaussian and coherent matrices | selection error | Improved |
| use iterative norm sampling when both target rank and missing rate are high | iterative norm sampling · synthetic Gaussian low-rank plus noise matrices | selection error | Hurt |
| use iterative norm sampling instead of leverage score sampling on very low-noise near-low-rank matrices | leverage score sampling · synthetic low-rank plus noise matrices | selection error | Improved |
| increase number of repeated columns (more coherence) (ablation) | norm sampling, block OMP, group Lasso · synthetic noisy low-rank, sigma=0.1, s=k=15 | selection error | Hurt |
| increase number of repeated columns (more coherence) (ablation) | volume sampling and iterative norm sampling · synthetic noisy low-rank, sigma=0.1, s=k=15 | selection error | No clear effect |
Closest papers by meaning
- A determinantal point process for column subset selection (JMLR 2020 · similarity 0.88)
- Multi-View Unsupervised Column Subset Selection via Combinatorial Search (Student Abstract) (AAAI 2025 · similarity 0.88)
- Linear Time Approximation Algorithm for Column Subset Selection with Local Search (NeurIPS 2024 · similarity 0.87)
- On Socially Fair Low-Rank Approximation and Column Subset Selection (NeurIPS 2024 · similarity 0.84)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.83)
- Turnstile $\ell_p$ leverage score sampling with applications (ICML 2024 · similarity 0.82)
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.
