Fetching the paper…
Reading the bibliography…
We study the phase retrieval problem, which solves quadratic system of equations, i.e., recovers a vector $\boldsymbol{x}\in \mathbb{R}^n$ from its magnitude measurements $y_i=|\langle \boldsymbol{a}_i, \boldsymbol{x}\rangle|, i=1,..., m$.
Angenäherte auflösung von systemen linearer gleichungen
S. Kaczmarz · 1937
Earlier work this paper cites.
Products and quotients of random variables and their applications
J. D. Donahue · 1964
Earlier work this paper cites.
A practical algorithm for the determination of phase from image and diffraction plane pictures
R. W. Gerchberg · 1972
Earlier work this paper cites.
Phase retrieval algorithms: a comparison
J. R. Fienup · 1982
Earlier work this paper cites.
Extending the methodology of x-ray crystallography to allow imaging of micrometre-sized non-crystalline specimens
J. Miao, P. Charalambous, J. Kirz, and D. Sayre · 1999
Earlier work this paper cites.
On fréchet subdifferentials
A. Y. Kruger · 2003
Earlier work this paper cites.
A robust gradient sampling algorithm for nonsmooth, nonconvex optimization
J. V. Burke, A. S. Lewis, and M. L. Overton · 2005
Earlier work this paper cites.
X-Ray Crystallography
J. Drenth · 2007
Earlier work this paper cites.
Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization
K. C. Kiwiel · 2007
Earlier work this paper cites.
Extending x-ray crystallography to allow the imaging of noncrystalline materials, cells, and single protein complexes
J. Miao, T. Ishikawa, Q. Shen, and T. Earnest · 2008
Earlier work this paper cites.
A randomized kaczmarz algorithm with exponential convergence
T. Strohmer and R. Vershynin · 2009
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Array imaging using intensity-only measurements
A. Chai, M. Moscoso, and G. Papanicolaou · 2011
Earlier work this paper cites.
Deep sparse rectifier neural networks
X. Glorot, A. Bordes, and Y. Bengio · 2011
Earlier work this paper cites.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
E. Moulines and F. R. Bach · 2011
Earlier work this paper cites.
Imagenet classification with deep convolutional neural networks
A. Krizhevsky, I. Sutskever, and G. E. Hinton · 2012
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Earlier work this paper cites.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
E. J. Candès, T. Strohmer, and V. Voroninski · 2013
Earlier work this paper cites.
Phase retrieval using alternating minimization
P. Netrapalli, P. Jain, and S. Sanghavi · 2013
Earlier work this paper cites.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Earlier work this paper cites.
Distributions of angles in random packing on spheres
T. T. Cai, J. Fan, and T. Jiang · 2013
Earlier work this paper cites.
Randomized extended kaczmarz for solving least squares
A. Zouzias and N. M. Freris · 2013
Cited alongside, same era.
Phase retrieval for imaging problems
F. Fogel, I. Waldspurger, and A. d’Aspremont · 2013
Cited alongside, same era.
Guaranteed matrix completion via non-convex factorization
R. Sun and Z.-Q. Luo · 2014
Cited alongside, same era.
Understanding alternating minimization for matrix completion
M. Hardt · 2014
Cited alongside, same era.
Non-convex robust pca
P. Netrapalli, U. Niranjan, S. Sanghavi, A. Anandkumar, and P. Jain · 2014
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Blind recovery of sparse signals from subsampled convolution
K. Lee, Y. Li, M. Junge, and Y. Bresler · 2015
Later among the works it cites.
On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
P. Ochs, A. Dosovitskiy, T. Brox, and T. Pock · 2015
Later among the works it cites.
The minimal measurement number for low-rank matrices recovery
Z. Xu · 2015
Later among the works it cites.
Escaping from saddle points—online stochastic gradient for tensor decomposition
R. Ge, F. Huang, C. Jin, and Y. Yuan · 2015
Later among the works it cites.
Phase retrieval via incremental truncated wirtinger flow
R. Kolte and A. Özgür · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Y. Chen and E. Candes · 2015
Cited alongside, same era.
Improved recovery guarantees for phase retrieval from coded diffraction patterns
D. Gross, F. Krahmer, and R. Kueng · 2015
Cited alongside, same era.
Phase recovery, maxcut and complex semidefinite programming
I. Waldspurger, A. d’Aspremont, and S. Mallat · 2015
Cited alongside, same era.
Phase retrieval with application to optical imaging: a contemporary overview
Y. Shechtman, Y. C. Eldar, O. Cohen, H. N. Chapman, J. Miao, and M. Segev · 2015
Cited alongside, same era.
Solving systems of phaseless equations via kaczmarz methods: a proof of concept study
K. Wei · 2015
Cited alongside, same era.
Phase retrieval using iterative projections: Dynamics in the large systems limit
G. Li, Y. Gu, and Y. M. Lu · 2015
Cited alongside, same era.
Closest in time.
Provable non-convex phase retrieval with outliers: Median truncated wirtinger flow
H. Zhang, Y. Chi, and Y. Liang · 2016
Closest in time.
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2016
Closest in time.
The local convexity of solving systems of quadratic equations
S. Sanghavi, R. Ward, and C. D. White · 2016
Closest in time.
Solving systems of random quadratic equations via truncated amplitude flow
G. Wang, G. B. Giannakis, and Y. C. Eldar · 2016
Closest in time.
Q. Zheng and J. Lafferty · 2016
Closest in time.
Provable efficient online matrix completion via non-convex stochastic gradient descent
C. Jin, S. M. Kakade, and P. Netrapalli · 2016
Closest in time.
Matrix completion has no spurious local minimum
R. Ge, J. D. Lee, and T. Ma · 2016
Closest in time.
Global optimality of local search for low rank matrix recovery
S. Bhojanapalli, B. Neyshabur, and N. Srebro · 2016
Closest in time.
D. Park, A. Kyrillidis, S. Bhojanapalli, C. Caramanis, and S. Sanghavi · 2016
Closest in time.
On the low-rank approach for semidefinite programs arising in synchronization and community detection
A. S. Bandeira, N. Boumal, and V. Voroninski · 2016
Closest in time.
Nonconvex phase synchronization
N. Boumal · 2016
Closest in time.
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
X. Li, S. Ling, T. Strohmer, and K. Wei · 2016
Closest in time.
Kaczmarz method for solving quadratic equations
Y. Chi and Y. M. Lu · 2016
Closest in time.
Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm
D. Needell, N. Srebro, and R. Ward · 2016
Closest in time.
Gradient descent converges to minimizers
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht · 2016
Closest in time.