Research map / Learning theory and algorithms / Sample complexity
Feature Adaptation for Sparse Linear Regression
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.91)
- Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation (NeurIPS 2018 · similarity 0.89)
- Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs (NeurIPS 2022 · similarity 0.89)
- Hardness and Algorithms for Robust and Sparse Optimization (ICML 2022 · similarity 0.89)
- Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements (ICML 2025 · similarity 0.87)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (ICML 2025 · similarity 0.87)
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.