Signal Recovery With Generative Priors
summary
Random ReLU feedforward generators with Gaussian weights and expansive layers are modeled as the prior and shown to permit compressive phase retrieval from phaseless linear measurements with optimal sample complexity ~k (ignoring logs) when the measurement matrix is Gaussian and the network is given. The nonconvex loss has a benign landscape so gradient descent converges (with a minor tweak) and experiments on digits beat sparsity methods at low measurements, but representation error causes an empirical error floor and out‑of‑distribution failures.
AI-written summary · about
chapters (14)
- 0:00Intro
- 2:03Recovery Guarantee for Sparse Signals
- 2:54Sparsity appears to fail in Compressive Phase Retrieval
- 5:44With generic measurements, Sparse PhaseLift gives suboptimal sample complexity
- 7:42Deep Generative Models
- 8:37Visualization of a generative model and its latent space
- 10:45Compressed Sensing with Generative Models
- 12:29Geometric picture of signal recovery with a low-dimensional generative prior
- 14:56Random generative priors allow rigorous recovery guarantees
- 17:54Compressive phase retrieval from generic measurements is possible at optimal sample complexity
- 21:27Proof requires concentration of discontinuous matrix- valued random functions
- 23:23Deep phase retrieval can outperform sparse phase retrieval in the low measurement regime
- 26:33Signal Recovery Under Generative Priors
- 28:59References
related talks
52mDeep Generative Models And Unsupervised Methods For Inverse Problems
29mImplicit Regularization in Nonconvex Statistical Estimation
26mLearning Sparse Data with Near-optimal Speed and Efficiency from a Variety of Measurement Processes
39mPhase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
44mRobust Estimation and Generative Adversarial Nets
01h 04mStatistical Physics and Computation in High Dimension
01h 20mThe elusive generalization: classical bounds to double descent to grokking
40mTraining generative models from locally privatized data via entropic optimal transport
