Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977)

scientific article; zbMATH DE number 7793223

Language	Label	Description	Also known as
English	Compressive phase retrieval: Optimal sample complexity with deep generative priors	scientific article; zbMATH DE number 7793223

Statements

instance of

scholarly article

0 references

title

Compressive phase retrieval: Optimal sample complexity with deep generative priors (English)

0 references

0 references

0 references

0 references

Communications on Pure and Applied Mathematics

0 references

publication date

23 January 2024

0 references

full work available at URL

https://arxiv.org/abs/2008.10579

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The Spiked Matrix Model With Generative Priors

0 references

A flexible convex relaxation for phase retrieval

0 references

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

0 references

A simple proof of the restricted isometry property for random matrices

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

0 references

Solving quadratic equations via phaselift when there are about as many equations as unknowns

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow

0 references

The numerics of phase retrieval

0 references

PhaseMax: Convex Phase Retrieval via Basis Pursuit

0 references

Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk

0 references

Rate-optimal denoising with deep neural networks

0 references

A provably convergent scheme for compressive sensing under random generative priors

0 references

Robust sparse phase retrieval made easy

0 references

Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements

0 references

Phase Retrieval Using Alternating Minimization

0 references

Do semidefinite relaxations solve sparse PCA up to the information limit?

0 references

Sparse Signal Recovery from Quadratic Measurements via Convex Programming

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

One-Bit Compressed Sensing by Linear Programming

0 references

Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization

0 references

A geometric analysis of phase retrieval

0 references

Q5840517

0 references

A strong restricted isometry property, with an application to phaseless compressed sensing

0 references

Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections

0 references

Phase recovery, MaxCut and complex semidefinite programming

0 references

Sparse Phase Retrieval via Truncated Amplitude Flow

0 references

A Problem in Geometric Probability.

0 references

Q4637073

0 references

Identifiers

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6141977