Compressive phase retrieval: Optimal sample complexity with deep generative priors

DOI10.1002/cpa.22155arXiv2008.10579MaRDI QIDQ6141977

Paul E. Hand, Vladislav Voroninski, Oscar Leong

Publication date: 23 January 2024

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
• Robust sparse phase retrieval made easy
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• A strong restricted isometry property, with an application to phaseless compressed sensing
• A simple proof of the restricted isometry property for random matrices
• A flexible convex relaxation for phase retrieval
• A geometric analysis of phase retrieval
• Do semidefinite relaxations solve sparse PCA up to the information limit?
• Phase recovery, MaxCut and complex semidefinite programming
• A provably convergent scheme for compressive sensing under random generative priors
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• One-Bit Compressed Sensing by Linear Programming
• Sparse Signal Recovery from Quadratic Measurements via Convex Programming
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• A Problem in Geometric Probability.
• Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
• PhaseMax: Convex Phase Retrieval via Basis Pursuit
• Phase Retrieval Using Alternating Minimization
• Sparse Phase Retrieval via Truncated Amplitude Flow
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
• The Spiked Matrix Model With Generative Priors
• Rate-optimal denoising with deep neural networks
• Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk
• Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
• Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
• Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• The numerics of phase retrieval

This page was built for publication: Compressive phase retrieval: Optimal sample complexity with deep generative priors