Research map / Learning theory and algorithms / Matrix and tensor methods
A Universal Analysis of Large-Scale Regularized Least Squares Solutions
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 |
|---|---|---|---|
| use non-Gaussian sensing matrices (centered Bernoulli, Student-t with 3 dof, asymmetric Bernoulli) instead of Gaussian | LASSO sensing matrix · Simulated LASSO with sparse signals | average L2 error vs theoretical prediction | No clear effect |
Closest papers by meaning
- The Well-Tempered Lasso (ICML 2018 · similarity 0.86)
- Implicit Regularization for Optimal Sparse Recovery (NeurIPS 2019 · similarity 0.86)
- Statistical-Computational Tradeoff in Single Index Models (NeurIPS 2019 · similarity 0.86)
- The Breakdown of Gaussian Universality in Classification of High-dimensional Linear Factor Mixtures (ICLR 2025 · similarity 0.85)
- Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning (NeurIPS 2024 · similarity 0.85)
- Regularized least squares learning with heavy-tailed noise is minimax optimal (NeurIPS 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.