Phase Retrieval Under a Generative Prior

The phase retrieval problem, arising from X-ray crystallography and medical imaging, asks to recover a signal given intensity-only measurements. When the number of measurements is less than the dimensionality of the signal, solving the problem requires additional assumptions, or priors, on its structure in order to guarantee recovery. Many techniques enforce a sparsity prior, meaning that the signal has very few non-zero entries. However, these methods have seen various computational bottlenecks. We sidestep this issue by enforcing a generative prior: the assumption that the signal is in the range of a generative neural network. By formulating an empirical risk minimization problem and directly optimizing over the domain of the generator, we show that the objective’s energy landscape exhibits favorable global geometry for gradient descent with information theoretically optimal sample complexity. Based on this geometric result, we introduce a gradient descent algorithm to converge to the true solution. We corroborate these results with experiments showing that exploiting generative models in phase retrieval tasks outperforms sparse phase retrieval methods.

Name thesis:degree_name

Master of Arts

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Engineering

Grantor

Rice University

Year dc:date.issued

2019

Author dc:creator

• Leong, Oscar

Advisor dc:contributor.advisor

• Hicks, Illya

Committee member dc:contributor.committeemember

• Hand, Paul

• Phase Retrieval
• Generative Models
• Non-convex Optimization
• Deep Learning

Statement dc:rights

• Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1911/105890

OAI identifier oai:identifier

oai:repository.rice.edu:1911/105890