Research map / Learning theory and algorithms / Matrix and tensor methods
Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs
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.
Closest papers by meaning
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.89)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 2025 · similarity 0.89)
- Feature Adaptation for Sparse Linear Regression (NeurIPS 2023 · similarity 0.89)
- Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data (ICLR 2026 · similarity 0.88)
- Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements (ICML 2025 · similarity 0.88)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.86)
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.