arrow
返回

Compressive phase retrieval: Optimal sample complexity with deep generative priors

delete2023-09-11
delete0
delete
OA
AI
P
Paul Hand
O
Oscar Leong *
V
Vladislav Voroninski
DOI:10.1002/cpa.22155delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Advances in compressive sensing (CS) provided reconstruction algorithms of sparse signals from linear measurements with optimal sample complexity, but natural extensions of this methodology to nonlinear inverse problems have been met with potentially fundamental sample complexity bottlenecks. In particular, tractable algorithms for compressive phase retrieval with sparsity priors have not been able to achieve optimal sample complexity. This has created an open problem in compressive phase retrieval: under generic, phaseless linear measurements, are there tractable reconstruction algorithms that succeed with optimal sample complexity? Meanwhile, progress in machine learning has led to the development of new data-driven signal priors in the form of generative models, which can outperform sparsity priors with significantly fewer measurements. In this work, we resolve the open problem in compressive phase retrieval and demonstrate that generative priors can lead to a fundamental advance by permitting optimal sample complexity by a tractable algorithm. We additionally provide empirics showing that exploiting generative priors in phase retrieval can significantly outperform sparsity priors. These results provide support for generative priors as a new paradigm for signal recovery in a variety of contexts, both empirically and theoretically. The strengths of this paradigm are that (1) generative priors can represent some classes of natural signals more concisely than sparsity priors, (2) generative priors allow for direct optimization over the natural signal manifold, which is intractable under sparsity priors, and (3) the resulting non-convex optimization problems with generative priors can admit benign optimization landscapes at optimal sample complexity, perhaps surprisingly, even in cases of nonlinear measurements.
Keyword:
RESTRICTED ISOMETRY PROPERTY
STABLE SIGNAL RECOVERY
QUADRATIC MEASUREMENTS
IMAGE
ALGORITHMS

期刊

Communications on Pure and Applied Mathematics 封面图
Communications on Pure and Applied Mathematics
IF:
2.7
论文数:
1.5K
被引数:
1.1W

机构

C
California Institute of Technology
学者数:
2.9W
论文数: 2.5W
被引数: 4.9W
N
Northeastern University
学者数:
2.5W
论文数: 1.6W
被引数: 3.0W
引用论文

引用论文

A multi-channel near-infrared spectroscopy study of prefrontal cortex activation during working memory task in major depressive disorder
err2011-05-01
err0
PREAI
errShenghong Pu; Takeshi Yamada; Katsutoshi Yokoyama; Hiroshi Matsumura; Hokuto Kobayashi; Natsuko Sasaki; Hideaki Mitani; Akiko Adachi; Koichi Kaneko; Kazuyuki Nakagome
err分享
err收藏
Preterm neonatal lateral ventricle volume from three-dimensional ultrasound is not strongly correlated to two-dimensional ultrasound measurements
err2016-11-09
err0
errOAAI
errJessica Kishimoto; Sandrine de Ribaupierre; Fateme Salehi; Walter Romano; David S. C. Lee; Aaron Fenster
err分享
err收藏
学者 查看更多内容