Provable Compressed Sensing with Generative Priors via Langevin Dynamics
Deep generative models have emerged as a powerful class of priors for signals in various inverse problems such as compressed sensing, phase retrieval and super-resolution. Here, we assume an unknown signal to lie in the range of some pre-trained generative model. A popular approach for signal recovery is via gradient descent in the low-dimensional latent space. While gradient descent has achieved good empirical performance, its theoretical behavior is not well understood. In this paper, we introduce the use of stochastic gradient Langevin dynamics (SGLD) for compressed sensing with a generative prior. Under mild assumptions on the generative model, we prove the convergence of SGLD to the true signal. We also demonstrate competitive empirical performance to standard gradient descent.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingRetrievalSuper-ResolutionSimilar Papers 제목 키워드 기반
Compressed Sensing with Approximate Priors via Conditional Resampling
We characterize the measurement complexity of compressed sensing of signals drawn from a known prior distribution, even when the support of the prior is the entire space (rather than, say, sparse vectors). We show for Ga…
compressed sensingDiversityRobust Compressed Sensing MRI with Deep Generative Priors
The CSGM framework (Bora-Jalal-Price-Dimakis'17) has shown that deep generative priors can be powerful tools for solving inverse problems. However, to date this framework has been empirically successful only on certain d…
compressed sensingInstance-Optimal Compressed Sensing via Posterior Sampling
We characterize the measurement complexity of compressed sensing of signals drawn from a known prior distribution, even when the support of the prior is the entire space (rather than, say, sparse vectors). We show for Ga…
compressed sensingDiversityRobust Compressed Sensing MR Imaging with Deep Generative Priors
The CSGM framework (Bora-Jalal-Price-Dimakis'17) has shown that deep generative priors can be powerful tools for solving inverse problems. However, to date this framework has been empirically successful only on certain d…
compressed sensingExact asymptotics for phase retrieval and compressed sensing with random generative priors
We consider the problem of compressed sensing and of (real-valued) phase retrieval with random measurement matrix. We derive sharp asymptotics for the information-theoretically optimal performance and for the best known …
compressed sensingRetrieval