An Elementary Proof of Convex Phase Retrieval in the Natural Parameter Space via the Linear Program PhaseMax

Abstract

The phase retrieval problem has garnered significant attention since the development of the PhaseLift algorithm, which is a convex program that operates in a lifted space of matrices. Because of the substantial computational cost due to lifting, many approaches to phase retrieval have been developed, including non-convex optimization algorithms which operate in the natural parameter space, such as Wirtinger Flow. Very recently, a convex formulation called PhaseMax has been discovered, and it has been proven to achieve phase retrieval via linear programming in the natural parameter space under optimal sample complexity. The current proofs of PhaseMax rely on statistical learning theory or geometric probability theory. Here, we present a short and elementary proof that PhaseMax exactly recovers real-valued vectors from random measurements under optimal sample complexity. Our proof only relies on standard probabilistic concentration and covering arguments, yielding a simpler and more direct proof than those that require statistical learning theory, geometric probability or the highly technical arguments for Wirtinger Flow-like approaches.

References in corpus (1)

• Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow

Cited by in corpus (15)

• Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation
• Compressive Phase Retrieval via Reweighted Amplitude Flow
• Phase Retrieval via Polytope Optimization: Geometry, Phase Transitions, and New Algorithms
• Compressed Sensing from Phaseless Gaussian Measurements via Linear Programming in the Natural Parameter Space
• Convolutional Phase Retrieval via Gradient Descent
• Corruption Robust Phase Retrieval via Linear Programming
• Sparse Phase Retrieval via Truncated Amplitude Flow
• Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval
• Solving systems of phaseless equations via Riemannian optimization with optimal sampling complexity
• Solving Almost all Systems of Random Quadratic Equations
• BranchHull: Convex bilinear inversion from the entrywise product of signals with known signs
• Solving Equations of Random Convex Functions via Anchored Regression
• Towards the optimal construction of a loss function without spurious local minima for solving quadratic equations
• Phase retrieval of complex-valued objects via a randomized Kaczmarz method
• Phase Retrieval by Alternating Minimization with Random Initialization