Research map / Learning theory and algorithms / Matrix and tensor methods
Dimensionality Reduction of Massive Sparse Datasets Using Coresets
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 |
|---|---|---|---|
| Deterministic coreset construction via Frank-Wolfe-style reduction to l2 item frequency approximation (weighted subset of rows of size O(k/eps^2)) | SVD/low-rank approximation coresets for sparse matrices · theoretical (no benchmark reported) | coreset size | No clear effect |
Closest papers by meaning
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.87)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.86)
- Universal Weak Coreset (AAAI 2024 · similarity 0.86)
- Robust Sparsification via Sensitivity (ICML 2025 · similarity 0.85)
- Coresets for Multiple $\ell_p$ Regression (ICML 2024 · similarity 0.85)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.85)
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.