Fetching the paper…
Reading the bibliography…
As science and engineering have become increasingly data-driven, the role of optimization has expanded to touch almost every stage of the data analysis pipeline, from signal and data acquisition to modeling and prediction.
A. L. Patterson, “A fourier series method for the determination of the components of interatomic distances in crystals,”
1934
Earlier work this paper cites.
A. L. Patterson, “Ambiguities in the x-ray analysis of crystal structures,”
1944
Earlier work this paper cites.
A. Walther, “The question of phase retrieval in optics,”
1963
Earlier work this paper cites.
H. Reichenbach in
1965
Earlier work this paper cites.
R. L. Bishop and B. O’Neill, “Manifolds of negative curvature,”
1969
Earlier work this paper cites.
S.-T. Yau, “Non-existence of continuous convex functions on certain riemannian manifolds,”
1974
Earlier work this paper cites.
D. Goldfarb, “Curvilinear path steplength algorithms for minimization which use directions of negative curvature,”
1980
Earlier work this paper cites.
R. Bott, “Lectures on morse theory, old and new,”
1982
Earlier work this paper cites.
K. G. Murty and S. N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,”
1987
Earlier work this paper cites.
C. Dainty and J. R. Fienup, “Phase retrieval and image reconstruction for astronomy,”
1987
Earlier work this paper cites.
P. Baldi and K. Hornik, “Neural networks and principal component analysis: Learning from examples without local minima,”
1989
Earlier work this paper cites.
G. Cybenko, “Approximation by superposition of sigmoidal functions,”
1989
Earlier work this paper cites.
P. Hajela, “Genetic search-an approach to the nonconvex optimization problem,”
1990
Earlier work this paper cites.
R. P. Millane, “Phase retrieval in crystallography and optics,”
1990
Earlier work this paper cites.
K. Hornik, “Approximation capabilities of multilayer feedforward networks,”
1991
Earlier work this paper cites.
P. J. Huber, “Robust estimation of a location parameter,” in
1992
Earlier work this paper cites.
W. H. Robert, “Phase problem in crystallography,”
1993
Earlier work this paper cites.
T. Rapcsák and T. Csendes, “Nonlinear coordinate transformations for unconstrained optimization ii. theoretical background,”
1993
Earlier work this paper cites.
Y. LeCun and Y. Bengio, “Convolutional networks for images, speech, and time series,” 1995
1995
Earlier work this paper cites.
Y. Nesterov, “Squared functional systems and optimization problems,” in
2000
Earlier work this paper cites.
SIAM, 2000
A. R. Conn, N. I. Gould, and P. L. Toint, · 2000
Earlier work this paper cites.
J. Miao, T. Ishikawa, B. Johnson, E. H. Anderson, B. Lai, and K. O. Hodgson, “High resolution 3d x-ray diffraction microscopy,”
2002
Earlier work this paper cites.
J.-L. Starck, E. Pantin, and F. Murtagh, “Deconvolution in astronomy: A review,”
2002
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,”
2003
Earlier work this paper cites.
Cambridge university press, 2004
S. Boyd and L. Vandenberghe, · 2004
Earlier work this paper cites.
J. V. Burke, A. S. Lewis, and M. L. Overton, “A robust gradient sampling algorithm for nonsmooth, nonconvex optimization,”
2005
Earlier work this paper cites.
J. D. Rennie and N. Srebro, “Fast maximum margin matrix factorization for collaborative prediction,” in
2005
Earlier work this paper cites.
Y. Nesterov and B. T. Polyak, “Cubic regularization of newton method and its global performance,”
2006
Earlier work this paper cites.
R. Balana, P. Casazzab, and D. Edidin, “On signal reconstruction without phase,”
2006
Earlier work this paper cites.
J. V. Corbett, “The pauli problem, state reconstruction and quantum-real numbers,”
2006
Earlier work this paper cites.
P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, “Semidefinite programming based algorithms for sensor network localization,”
2006
Earlier work this paper cites.
J. F. Murray and K. Kreutz-Delgado, “Learning sparse overcomplete codes for images,”
2006
Earlier work this paper cites.
M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,”
2006
Earlier work this paper cites.
E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,”
2006
Earlier work this paper cites.
P.-A. Absil, C. G. Baker, and K. A. Gallivan, “Trust-region methods on Riemannian manifolds,”
2007
Earlier work this paper cites.
O. Bunk, A. Diaz, F. Pfeiffer, C. David, B. Schmitt, D. K. Satapathy, and J. F. van der Veen, “Diffractive imaging for periodic samples: retrieving one-dimensional concentration profiles across microfluidic channels,”
2007
Earlier work this paper cites.
A. M.-C. So and Y. Ye, “Theory of semidefinite programming for sensor network localization,”
2007
Earlier work this paper cites.
S. Dasgupta and L. Schulman, “A probabilistic analysis of em for mixtures of separated, spherical gaussians,”
2007
Earlier work this paper cites.
E. Candes and J. Romberg, “Sparsity and incoherence in compressive sampling,”
2007
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,”
2009
Earlier work this paper cites.
Y. Koren, “The bellkor solution to the netflix grand prize,” 2009
2009
Earlier work this paper cites.
Princeton University Press, 2009
P.-A. Absil, R. Mahoney, and R. Sepulchre, · 2009
Earlier work this paper cites.
T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,”
2009
Earlier work this paper cites.
Springer Science & Business Media, 2009
R. T. Rockafellar and R. J.-B. Wets, · 2009
Earlier work this paper cites.
A. Chai, M. Moscoso, and G. Papanicolaou, “Array imaging using intensity-only measurements,”
2010
Earlier work this paper cites.
R. V. Balan, “On signal reconstruction from its spectrogram,” in
2010
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,”
2010
Earlier work this paper cites.
L. Wu, A. Ganesh, B. Shi, Y. Matsushita, Y. Wang, and Y. Ma, “Robust photometric stereo via low-rank matrix completion and recovery,” in
2010
Earlier work this paper cites.
H. Xu, C. Caramanis, and S. Sanghavi, “Robust pca via outlier pursuit,” in
2010
Earlier work this paper cites.
J. Wright, Y. Ma, J. Mairal, G. Sapiro, T. S. Huang, and S. Yan, “Sparse representation for computer vision and pattern recognition,”
2010
Earlier work this paper cites.
Springer Science & Business Media, 2010
M. Elad, · 2010
Earlier work this paper cites.
J. Yang, J. Wright, T. S. Huang, and Y. Ma, “Image super-resolution via sparse representation,”
2010
Earlier work this paper cites.
E. J. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,”
2010
Earlier work this paper cites.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?,”
2011
Earlier work this paper cites.
Y. Peng, A. Ganesh, J. Wright, W. Xu, and Y. Ma, “Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images,”
2012
Earlier work this paper cites.
D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in
2012
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in
2012
Earlier work this paper cites.
E. J. Candès, Y. C. Eldar, T. Strohmer, and V. Voroninski, “Phase retrieval via matrix completion,”
2013
Earlier work this paper cites.
E. J. Candès, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,”
2013
Earlier work this paper cites.
T. Heinosaari, L. Mazzarella, and M. M. Wolf, “Quantum tomography under prior information,”
2013
Earlier work this paper cites.
J. R. Fienup, “Phase retrieval algorithms: a personal tour,”
2013
Earlier work this paper cites.
Y. Yang, J. Ma, and S. Osher, “Seismic data reconstruction via matrix completion,”
2013
Earlier work this paper cites.
C. J. Hillar and L.-H. Lim, “Most tensor problems are NP-hard,”
2013
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
X. Zhou, C. Yang, H. Zhao, and W. Yu, “Low-rank modeling and its applications in image analysis,”
2014
Earlier work this paper cites.
Q. Qu, J. Sun, and J. Wright, “Finding a sparse vector in a subspace: Linear sparsity using alternating directions,” in
2014
Earlier work this paper cites.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,”
2014
Earlier work this paper cites.
A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky, “Tensor decompositions for learning latent variable models,”
2014
Earlier work this paper cites.
Y. Shechtman, Y. C. Eldar, O. Cohen, H. N. Chapman, J. Miao, and M. Segev, “Phase retrieval with application to optical imaging: a contemporary overview,”
2015
Earlier work this paper cites.
J. Sun, Q. Qu, and J. Wright, “When are nonconvex problems not scary?,”
2015
Earlier work this paper cites.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in
2015
Earlier work this paper cites.
E. J. Candes, X. Li, and M. Soltanolkotabi, “Phase retrieval via wirtinger flow: Theory and algorithms,”
2015
Earlier work this paper cites.
K. Jaganathan, Y. C. Eldar, and B. Hassibi, “Phase retrieval: An overview of recent developments,”
2015
Earlier work this paper cites.
E. J. Candès, X. Li, and M. Soltanolkotabi, “Phase retrieval from coded diffraction patterns,”
2015
Cited alongside, same era.
L.-H. Yeh, J. Dong, J. Zhong, L. Tian, M. Chen, G. Tang, M. Soltanolkotabi, and L. Waller, “Experimental robustness of fourier ptychography phase retrieval algorithms,”
2015
Cited alongside, same era.
L. Tian and L. Waller, “3d intensity and phase imaging from light field measurements in an led array microscope,”
2015
Cited alongside, same era.
I. Waldspurger, A. d`Aspremont, and S. Mallat, “Phase recovery, maxcut and complex semidefinite programming,”
2015
Cited alongside, same era.
R. Kumar, C. Da Silva, O. Akalin, A. Y. Aravkin, H. Mansour, B. Recht, and F. J. Herrmann, “Efficient matrix completion for seismic data reconstruction,”
2015
Cited alongside, same era.
I. Safran and O. Shamir, “Spurious local minima are common in two-layer relu neural networks,” in
2018
Later among the works it cites.
S. Liang, R. Sun, J. D. Lee, and R. Srikant, “Adding one neuron can eliminate all bad local minima,”
2018
Later among the works it cites.
U. Shaham, A. Cloninger, and R. R. Coifman, “Provable approximation properties for deep neural networks,”
2018
Later among the works it cites.
D. Soudry, E. Hoffer, M. S. Nacson, S. Gunasekar, and N. Srebro, “The implicit bias of gradient descent on separable data,”
2018
Later among the works it cites.
D. Davis, D. Drusvyatskiy, K. J. MacPhee, and C. Paquette, “Subgradient methods for sharp weakly convex functions,”
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,”
2015
Cited alongside, same era.
2015
Cited alongside, same era.
B. D. Haeffele and R. Vidal, “Global optimality in tensor factorization, deep learning, and beyond,”
2015
Cited alongside, same era.
B. Barak, J. A. Kelner, and D. Steurer, “Dictionary learning and tensor decomposition via the sum-of-squares method,” in
2015
Cited alongside, same era.
MIT press, 2016
I. Goodfellow, Y. Bengio, and A. Courville, · 2016
Cited alongside, same era.
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, “Gradient descent only converges to minimizers,” in
2016
Cited alongside, same era.
Princeton university press, 2016
J. Milnor, · 2016
Cited alongside, same era.
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Chi, Y. M. Lu, and Y. Chen, “Nonconvex optimization meets low-rank matrix factorization: An overview,”
2019
Later among the works it cites.
J. D. Lee, I. Panageas, G. Piliouras, M. Simchowitz, M. I. Jordan, and B. Recht, “First-order methods almost always avoid strict saddle points,”
2019
Later among the works it cites.
Z. Allen-Zhu, Y. Li, and Z. Song, “A convergence theory for deep learning via over-parameterization,” in
2019
Later among the works it cites.
S. Du, J. Lee, H. Li, L. Wang, and X. Zhai, “Gradient descent finds global minima of deep neural networks,” in
2019
Later among the works it cites.
R. Sun, “Optimization for deep learning: theory and algorithms,”
2019
Later among the works it cites.
J. Hu, X. Liu, Z. Wen, and Y. Yuan, “A brief introduction to manifold optimization,” 2019
2019
Later among the works it cites.
W. Qian, Y. Zhang, and Y. Chen, “Global convergence of least squares EM for demixing two log-concave densities,” in
2019
Later among the works it cites.
J. Kwon, W. Qian, C. Caramanis, Y. Chen, and D. Davis, “Global convergence of the EM algorithm for mixtures of two component linear regression,” in
2019
Later among the works it cites.
D. Gilboa, S. Buchanan, and J. Wright, “Efficient dictionary learning with gradient descent,”
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Y. Lau, Q. Qu, H.-W. Kuo, P. Zhou, Y. Zhang, and J. Wright, “Short-and-sparse deconvolution – a geometric approach,”
2019
Later among the works it cites.
Q. Qu, X. Li, and Z. Zhu, “A nonconvex approach for exact and efficient multichannel sparse blind deconvolution,” in
2019
Later among the works it cites.
M. R. Kellman, E. Bostan, N. A. Repina, and L. Waller, “Physics-based learned design: optimized coded-illumination for quantitative phase imaging,”
2019
Later among the works it cites.
J. C. Duchi and F. Ruan, “Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval,”
2019
Later among the works it cites.
X. Li, J. Lu, R. Arora, J. Haupt, H. Liu, Z. Wang, and T. Zhao, “Symmetry, saddle points, and global optimization landscape of nonconvex matrix factorization,”
2019
Later among the works it cites.
2019
Later among the works it cites.
T. Maunu, T. Zhang, and G. Lerman, “A well-tempered landscape for non-convex robust subspace recovery,”
2019
Later among the works it cites.
Y. Zhai, Z. Yang, Z. Liao, J. Wright, and Y. Ma, “Complete dictionary learning via
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Janzamin, R. Ge, J. Kossaifi, and A. Anandkumar, “Spectral learning on matrices and tensors,”
2019
Later among the works it cites.
2019
Later among the works it cites.
Z. Zhu, D. Soudry, Y. C. Eldar, and M. B. Wakin, “The global optimization geometry of shallow linear neural networks,”
2019
Later among the works it cites.
S. Arora, N. Cohen, W. Hu, and Y. Luo, “Implicit regularization in deep matrix factorization,”
2019
Later among the works it cites.
Y. Bai, Q. Jiang, and J. Sun, “Subgradient descent learns orthogonal dictionaries,” in
2019
Later among the works it cites.
2019
Later among the works it cites.
C. Criscitiello and N. Boumal, “Efficiently escaping saddle points on manifolds,” in
2019
Later among the works it cites.
Y. Sun, N. Flammarion, and M. Fazel, “Escaping from saddle points on riemannian manifolds,” in
2019
Later among the works it cites.
W. Qian, Y. Zhang, and Y. Chen, “Structures of spurious local minima in
2020
Closest in time.
K. Wang, Y. Yan, and M. Diaz, “Efficient clustering for stretched mixtures: Landscape and optimality,” 2020
2020
Closest in time.
A. Fannjiang and T. Strohmer, “The numerics of phase retrieval,” 2020
2020
Closest in time.
2020
Closest in time.
J. Hu, X. Liu, Z.-W. Wen, and Y.-X. Yuan, “A brief introduction to manifold optimization,”
2020
Closest in time.
J. H. Manton, “Geometry, manifolds, and nonconvex optimization: How geometry can help optimization,”
2020
Closest in time.
2020
Closest in time.
P. Grohs, S. Koppensteiner, and M. Rathmair, “Phase retrieval: uniqueness and stability,”
2020
Closest in time.
X. Li, Z. Zhu, A. Man-Cho So, and R. Vidal, “Nonconvex robust low-rank matrix recovery,”
2020
Closest in time.
Y. Shen, Y. Xue, J. Zhang, K. B. Letaief, and V. Lau, “Complete dictionary learning via
2020
Closest in time.
N. Boumal, “An introduction to optimization on smooth manifolds.” Available online, Aug 2020
2020
Closest in time.
S. C. Cheung, J. Y. Shin, Y. Lau, Z. Chen, J. Sun, Y. Zhang, M. A. Müller, I. M. Eremin, J. N. Wright, and A. N. Pasupathy, “Dictionary learning in fourier-transform scanning tunneling spectroscopy,”
2020
Closest in time.
A. W. Senior, R. Evans, J. Jumper, J. Kirkpatrick, L. Sifre, T. Green, C. Qin, A. Žídek, A. W. Nelson, A. Bridgland,
2020
Closest in time.
R.-Y. Sun, “Optimization for deep learning: An overview,”
2020
Closest in time.
R. Sun, D. Li, S. Liang, T. Ding, and R. Srikant, “The global landscape of neural networks: An overview,”
2020
Closest in time.
2020
Closest in time.
D. G. Mixon, H. Parshall, and J. Pi, “Neural collapse with unconstrained features,”
2020
Closest in time.
J. Lu and S. Steinerberger, “Neural collapse with cross-entropy loss,”
2020
Closest in time.
2020
Closest in time.
V. Papyan, X. Han, and D. L. Donoho, “Prevalence of neural collapse during the terminal phase of deep learning training,”
2020
Closest in time.
C. You, Z. Zhu, Q. Qu, and Y. Ma, “Robust recovery via implicit bias of discrepant learning rates for double over-parameterization,”
2020
Closest in time.
C. Jin, P. Netrapalli, R. Ge, S. M. Kakade, and M. I. Jordan, “On nonconvex optimization for machine learning: Gradients, stochasticity, and saddle points,”
2021
Closest in time.
Z. Li, K. Lange, and J. A. Fessler, “Algorithms for poisson phase retrieval,”
2021
Closest in time.
PhD thesis, Johns Hopkins University, 2021
T. Ding · 2021
Closest in time.
J. Berner, P. Grohs, G. Kutyniok, and P. Petersen, “The modern mathematics of deep learning,”
2021
Closest in time.
C. Fang, H. Dong, and T. Zhang, “Mathematical models of overparameterized neural networks,”
2021
Closest in time.
C. Fang, H. He, Q. Long, and W. J. Su, “Exploring deep neural networks via layer-peeled model: Minority collapse in imbalanced training,”
2021
Closest in time.
F. Graf, C. Hofer, M. Niethammer, and R. Kwitt, “Dissecting supervised constrastive learning,” in
2021
Closest in time.
T. Ergen and M. Pilanci, “Revealing the structure of deep neural networks via convex duality,” in
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
N. Boumal, “An introduction to optimization on smooth manifolds.” To appear with Cambridge University Press, Apr 2022
2022
Closest in time.
W. Ji, Y. Lu, Y. Zhang, Z. Deng, and W. J. Su, “An unconstrained layer-peeled perspective on neural collapse,” in
2022
Closest in time.
2022
Closest in time.
X. Han, V. Papyan, and D. L. Donoho, “Neural collapse under MSE loss: Proximity to and dynamics on the central path,” in
2022
Closest in time.