Research map / Learning theory and algorithms / Matrix and tensor methods
SPSD Matrix Approximation vis Column Selection: Theories, Algorithms, and Extensions
Shusen Wang, Luo Luo, Zhihua Zhang
Read the paperCheck your idea against 137,217 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
- Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition (JMLR 2016 · similarity 0.91)
- Revisiting the Nyström Method for Improved Large-scale Machine Learning (JMLR 2016 · similarity 0.89)
- Entrywise error bounds for low-rank approximations of kernel matrices (NeurIPS 2024 · similarity 0.85)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.84)
- Linear Time Approximation Algorithm for Column Subset Selection with Local Search (NeurIPS 2024 · similarity 0.84)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (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.
