Research map / Learning theory and algorithms / Matrix and tensor methods
Fast Compressive Phase Retrieval under Bounded Noise
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
- A Fast and Provable Algorithm for Sparse Phase Retrieval (ICLR 2024 · similarity 0.91)
- Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors (NeurIPS 2021 · similarity 0.90)
- Exponential Spectral Pursuit: An Effective Initialization Method for Sparse Phase Retrieval (ICML 2024 · similarity 0.88)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 2025 · similarity 0.86)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.85)
- Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements (ICML 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.