Papers › A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution
A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution
Qing Qu, Xiao Li, Zhihui Zhu
We study the multi-channel sparse blind deconvolution (MCS-BD) problem, whose task is to simultaneously recover a kernel 𝐚 and multiple sparse inputs {𝐱ᵢ}ᵢ₌₁ᵖ from their circulant convolution 𝐲ᵢ = 𝐚 ⊛𝐱ᵢ (i=1,⋯,p). We formulate the task as a nonconvex optimization problem over the sphere. Under mild statistical assumptions of the data, we prove that the vanilla Riemannian gradient descent (RGD) method, with random initializations, provably recovers both the kernel 𝐚 and the signals {𝐱ᵢ}ᵢ₌₁ᵖ up to a signed shift ambiguity. In comparison with state-of-the-art results, our work shows significant improvements in terms of sample complexity and computational efficiency. Our theoretical results are corroborated by numerical experiments, which demonstrate superior performance of the proposed approach over the previous methods on both synthetic and real datasets.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections