Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We study the question of extracting a sequence of functions |$\{\boldsymbol{f}_{\!i}, \boldsymbol{g}_{i}\}_{i=1}^{s}$| from observing only the sum of their convolutions, i.e. from |$\boldsymbol{y} = \sum _{i=1}^{s} \boldsymbol{f}_{\!i}\ast \boldsymbol{g}_{i}$|. While convex optimization techniques are able to solve this joint blind deconvolution–demixing problem provably and robustly under certain conditions, for medium-size or large-size problems we need computationally faster methods without sacrificing the benefits of mathematical rigor that come with convex methods. In this paper we present a non-convex algorithm which guarantees exact recovery under conditions that are competitive with convex optimization methods, with the additional advantage of being computationally much more efficient. Our two-step algorithm converges to the global minimum linearly and is also robust in the presence of additive noise. While the derived performance bounds are suboptimal in terms of the information-theoretic limit, numerical simulations show remarkable performance even if the number of measurements is close to the number of degrees of freedom. We discuss an application of the proposed framework in wireless communications in connection with the Internet-of-Things.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Sun, J., Qu, Q., & Wright, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632162 · Cited by 213
Cited by
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Blind Over-the-Air Computation and Data Fusion via Provable Wirtinger Flow
Dong, J., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2970338 · Cited by 65
Nonconvex Demixing From Bilinear Measurements
Dong, J., & Shi, Y. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2864660 · Cited by 37
Blind Demixing for Low-Latency Communication
Dong, J., Yang, K., & Shi, Y. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2886191 · Cited by 22
Metadata
- Authors
- Ling, S., & Strohmer, T.
- Venue
- Information and Inference: A Journal of the IMA
- Publisher
- Oxford University Press (OUP)
- Published
- 2018-03-08
- Volume
- 8
- Issue
- 1
- Pages
- 1-49
- ISSN
- 2049-8764 (ISSN-L)
- 2049-8772
- OpenAlex
- W2963430899
- Cited by
- 47
- References
- 1
- FWCI
- 6.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing. https://app.cochat.ai/papers/10.1093/imaiai/iax022
- The paper
- Ling, S., & Strohmer, T. (2019). Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing. Information and Inference: A Journal of the IMA. https://doi.org/10.1093/imaiai/iax022
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.