Research map / Learning theory and algorithms / Matrix and tensor methods
Geometry and Symmetry in Short-and-Sparse Deconvolution
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 the proposed minimization and refinement algorithm | SaS deconvolution · Bernoulli-Gaussian sparse signal with a shift-incoherent motif | recovery error: ≤ ε | Helped |
| Require lower shift coherence | SaS deconvolution · Bernoulli-Gaussian sparse signal | maximum allowable sparsity rate: θ ≲ 1/(p₀√μ + √p₀) | Helped |
Closest papers by meaning
- Structured Local Minima in Sparse Blind Deconvolution (NeurIPS 2018 · similarity 0.89)
- Short and Sparse Deconvolution --- A Geometric Approach (ICLR 2020 · similarity 0.88)
- Global Geometry of Multichannel Sparse Blind Deconvolution on the Sphere (NeurIPS 2018 · similarity 0.88)
- A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution (NeurIPS 2019 · similarity 0.88)
- On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution (CVPR 2017 · similarity 0.88)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 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.