Research map / Learning theory and algorithms / Matrix and tensor methods
Blind Deconvolutional Phase Retrieval via Convex Programming
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 known standard Gaussian subspaces for both signals | Proposed convex program · Phaseless Fourier measurements of circular convolution | sample complexity for exact recovery: m \geq c_t (k+n)\log^2 m | Helped |
| Use deterministic subspaces such as partial DCT or partial wavelets instead of random subspaces | Proposed convex relaxation · Blind deconvolutional phase retrieval with deterministic subspaces | recovery effectiveness | Hurt |
| Use an identity-column subspace for one signal and a Gaussian subspace for the other | Proposed convex framework · Phaseless Fourier measurements of circular convolution | recovery success | No clear effect |
Closest papers by meaning
- Convolutional Phase Retrieval (NeurIPS 2017 · similarity 0.91)
- Convex Phase Retrieval without Lifting via PhaseMax (ICML 2017 · similarity 0.90)
- Universality in Learning from Linear Measurements (NeurIPS 2019 · similarity 0.89)
- A convex program for bilinear inversion of sparse vectors (NeurIPS 2018 · similarity 0.88)
- A Fast and Provable Algorithm for Sparse Phase Retrieval (ICLR 2024 · similarity 0.87)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (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.