Research map / Learning theory and algorithms / Matrix and tensor methods
Fast and Accurate Least-Mean-Squares Solvers
Alaa Maalouf, Ibrahim Jubran, Dan Feldman
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 |
|---|---|---|---|
| run solver on LMS-Coreset (Caratheodory-based compression) instead of full data | sklearn Linear/Ridge/Lasso/Elastic-net solvers · synthetic and UCI datasets | running time: up to x10; x10--x100 with cross validation | Improved |
| run solver on coreset instead of full data | LMS solvers · synthetic and UCI datasets | accuracy | No clear effect |
| use coreset booster instead of SKETCH+CHOLESKY / SKETCH+SVD / SKETCH+INVERSE | 32-bit float LMS solving · UCI datasets (i),(iii) | numerical error | Improved |
| use coreset booster instead of SKETCH+CHOLESKY | 32-bit float LMS solving · UCI datasets | running time: slower by at most factor of 2 | Hurt |
| use faster high-dimension variant (Algorithm with k1,k2, sparsified points) instead of full Caratheodory variant (ablation) | LMS-Coreset++ · synthetic and Dataset (iv) | running time vs numerical error | Improved |
| set k2 to (d+1)^2 divided by 12 instead of theoretical optimum (d+1)^2 (ablation) | LMS-Coreset++ · synthetic data | running time | Improved |
Closest papers by meaning
- Fast and Accurate Least-Mean-Squares Solvers for High Dimensional Data (TPAMI 2022 · similarity 0.98)
- Faster Algorithms for Structured Linear and Kernel Support Vector Machines (ICLR 2025 · similarity 0.85)
- Efficient Algorithms for Sum-Of-Minimum Optimization (ICML 2024 · similarity 0.84)
- Precise asymptotics of reweighted least-squares algorithms for linear diagonal networks (NeurIPS 2024 · similarity 0.84)
- Distributed Least Squares in Small Space via Sketching and Bias Reduction (NeurIPS 2024 · similarity 0.83)
- Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions (ICLR 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.
