Research map / Optimization / Optimizers
Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance
Yasutoshi Ida, Sekitoshi Kanai, Yasuhiro Fujiwara, Tomoharu Iwata, Koh Takeuchi, Hisashi Kashima
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 |
|---|---|---|---|
| skip upper-bound rows plus selective update (fast deterministic CUR) vs original coordinate descent | deterministic CUR · five datasets (wall clock) | wall clock time: reduction ratio 34.64% to 67.80% of origin time | Improved |
| fast deterministic CUR vs origin, Slashdot wall-clock | deterministic CUR · Slashdot | wall clock time: 47.04% of origin | Improved |
| fast deterministic CUR vs origin, objective values | deterministic CUR · colon-cancer, Bioresponse, QSAR-TID-52, Madelon, Slashdot | objective value: identical objectives | No clear effect |
| fast deterministic CUR vs SSR+WS and SSR | deterministic CUR · QSAR-TID-52, Madelon, Slashdot | wall clock time: ours faster than SSR+WS on QSAR, Slashdot; roughly tied on Madelon (1.006e3 vs 1.008e3) | Improved |
| fast deterministic CUR vs origin, number of Eq. (2) updates | deterministic CUR · colon-cancer, Bioresponse, QSAR-TID-52, Madelon, Slashdot | number of coordinate updates: e.g., Madelon 1.847e6 to 2.162e5 | Improved |
| fast deterministic CUR vs origin on gene expression data (100 to 10000 columns) | deterministic CUR · gene expression data (Figure 2) | wall clock time: 10x faster than origin and 4x faster than SSR+WS at 1000 columns | Improved |
| SSR and SSR+WS screening (not applied to ours) on large datasets | sequential strong rule · colon-cancer, Bioresponse | wall clock time: did not finish within a month | Hurt |
Closest papers by meaning
- Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition (JMLR 2016 · similarity 0.87)
- Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach (JMLR 2023 · similarity 0.87)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.86)
- Debiasing Random Oblique Projections for Subsampled OLS and Fast CUR in High Dimensions (NeurIPS 2026 · similarity 0.86)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.85)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · 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.
