Research map / Learning theory and algorithms / Sample complexity
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
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
- Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit (ICML 2018 · similarity 0.91)
- Sparse Convex Optimization via Adaptively Regularized Hard Thresholding (ICML 2020 · similarity 0.89)
- Sparse Bayesian Learning via Stepwise Regression (ICML 2021 · similarity 0.88)
- Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery (NeurIPS 2017 · similarity 0.87)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 2025 · similarity 0.85)
- Straight-Through Meets Sparse Recovery: the Support Exploration Algorithm (ICML 2024 · 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.