A provably convergent scheme for compressive sensing under random generative priors

DOI10.1007/s00041-021-09830-5zbMath1460.94023arXiv1812.04176OpenAlexW3137849220MaRDI QIDQ2658735

Reinhard Heckel, Vladislav Voroninski, Wen Huang, Paul E. Hand

Publication date: 24 March 2021

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04176

zbMATH Keywords

convergence analysisgradient descentcompressive sensinggenerative models

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items (4)

Solving Inverse Problems by Joint Posterior Maximization with Autoencoding Prior ⋮ Compressive phase retrieval: Optimal sample complexity with deep generative priors ⋮ Just least squares: binary compressive sampling with low generative intrinsic dimension ⋮ Consistent approximations in composite optimization

Uses Software

• Glow

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• Compressed Sensing: How Sharp Is the Restricted Isometry Property?
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk
• Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization

This page was built for publication: A provably convergent scheme for compressive sensing under random generative priors