Fetching the paper…
Reading the bibliography…
We consider the problem of estimating the factors of a rank-$1$ matrix with i.i.d.
On rings of operators. reduction theory
J. von Neumann · 1949
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Regression analysis under link violation
K.-C. Li and N. Duan · 1989
Earlier work this paper cites.
Restoration of astronomical images by iterative blind deconvolution
S. M. Jefferies and J. C. Christou · 1993
Earlier work this paper cites.
Black-box complexity of local minimization
S. A. Vavasis · 1993
Earlier work this paper cites.
No eigenvalues outside the support of the limiting spectral distribution of large-dimensional sample covariance matrices
Z.-D. Bai and J. W. Silverstein · 1998
Earlier work this paper cites.
Blind equalization and multiuser detection in dispersive CDMA channels
X. Wang and H. V. Poor · 1998
Earlier work this paper cites.
Concentration of the spectral measure for large matrices
A. Guionnet and O. Zeitouni · 2000
Earlier work this paper cites.
Statistical inference
G. Casella and R. L. Berger · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. D. Monteiro · 2003
Earlier work this paper cites.
CLT for linear spectral statistics of large-dimensional sample covariance matrices
Z. Bai and J. W. Silverstein · 2004
Earlier work this paper cites.
Convex optimization
S. P. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
A generalization of the Lindeberg principle
S. Chatterjee · 2006
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
D. L. Donoho, A. Maleki, and A. Montanari · 2009
Earlier work this paper cites.
Concentration of measure and spectra of random matrices: Applications to correlation matrices, elliptical distributions and beyond
N. El Karoui · 2009
Earlier work this paper cites.
Concentration of the spectral measure of large Wishart matrices with dependent entries
A. Guntuboyina and H. Leeb · 2009
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. A. Parrilo · 2010
Earlier work this paper cites.
The Lasso risk for Gaussian matrices
M. Bayati and A. Montanari · 2011
Earlier work this paper cites.
Fast global convergence of gradient methods for high-dimensional statistical recovery
A. Agarwal, S. Negahban, and M. J. Wainwright · 2012
Earlier work this paper cites.
A generalized linear model with “Gaussian” regressor variables
D. R. Brillinger · 2012
Earlier work this paper cites.
High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity
P.-L. Loh and M. J. Wainwright · 2012
Earlier work this paper cites.
How to make the gradients small
Y. Nesterov · 2012
Earlier work this paper cites.
Topics in random matrix theory
T. Tao · 2012
Earlier work this paper cites.
Blind deconvolution using convex programming
A. Ahmed, B. Recht, and J. Romberg · 2013
Earlier work this paper cites.
N. El Karoui · 2013
Earlier work this paper cites.
On robust regression with high-dimensional predictors
N. El Karoui, D. Bean, P. J. Bickel, C. Lim, and B. Yu · 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.
1-bit matrix completion
M. A. Davenport, Y. Plan, E. Van Den Berg, and M. Wootters · 2014
Earlier work this paper cites.
Fast matrix completion without the condition number
M. Hardt and M. Wootters · 2014
Cited alongside, same era.
Universality in polytope phase transitions and message passing algorithms
M. Bayati, M. Lelarge, and A. Montanari · 2015
Cited alongside, same era.
Y. Chen and M. J. Wainwright · 2015
Cited alongside, same era.
Matrix completion under monotonic single index models
R. S. Ganti, L. Balzano, and R. Willett · 2015
Cited alongside, same era.
Phase retrieval using alternating minimization
P. Netrapalli, P. Jain, and S. Sanghavi · 2015
Cited alongside, same era.
Efficient matrix sensing using rank- 1 1 Gaussian measurements
Estimating the coefficients of a mixture of two linear regressions by expectation maximization
J. M. Klusowski, D. Yang, and W. Brinda · 2019
Later among the works it cites.
Global convergence of the EM algorithm for mixtures of two component linear regression
J. Kwon, W. Qian, C. Caramanis, Y. Chen, and D. Davis · 2019
Later among the works it cites.
Lifting high-dimensional non-linear models with Gaussian regressors
C. Thrampoulidis and A. S. Rawat · 2019
Later among the works it cites.
High-dimensional statistics: A non-asymptotic viewpoint , volume 48
M. J. Wainwright · 2019
Later among the works it cites.
Misspecified nonconvex statistical optimization for sparse phase retrieval
Z. Yang, L. F. Yang, E. X. Fang, T. Zhao, Z. Wang, and M. Neykov · 2019
Later among the works it cites.
Structured local optima in sparse blind deconvolution
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Zhong, P. Jain, and I. S. Dhillon · 2015
Cited alongside, same era.
Global optimality of local search for low rank matrix recovery
S. Bhojanapalli, B. Neyshabur, and N. Srebro · 2016
Cited alongside, same era.
Matrix completion has no spurious local minimum
R. Ge, J. D. Lee, and T. Ma · 2016
Cited alongside, same era.
Parametric bilinear generalized approximate message passing
J. T. Parker and P. Schniter · 2016
Cited alongside, same era.
The generalized Lasso with non-linear observations
Y. Plan and R. Vershynin · 2016
Cited alongside, same era.
On the method of typical bounded differences
L. Warnke · 2016
Cited alongside, same era.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
S. Balakrishnan, M. J. Wainwright, and B. Yu · 2017
Cited alongside, same era.
Y. Zhang, H.-W. Kuo, and J. Wright · 2019
Later among the works it cites.
State evolution for approximate message passing with non-separable functions
R. Berthier, A. Montanari, and P.-M. Nguyen · 2020
Later among the works it cites.
Lower bounds for finding stationary points i
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford · 2020
Later among the works it cites.
The estimation error of general first order methods
M. Celentano, A. Montanari, and Y. Wu · 2020
Later among the works it cites.
Alternating minimization converges super-linearly for mixed linear regression
A. Ghosh and K. Ramchandran · 2020
Later among the works it cites.
Instability, computational efficiency and statistical accuracy
N. Ho, K. Khamaru, R. Dwivedi, M. J. Wainwright, M. I. Jordan, and B. Yu · 2020
Later among the works it cites.
Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
C. Ma, K. Wang, Y. Chi, and Y. Chen · 2020
Later among the works it cites.
From symmetry to geometry: Tractable nonconvex problems
Y. Zhang, Q. Qu, and J. Wright · 2020
Later among the works it cites.
The high-dimensional asymptotics of first order methods with random data
M. Celentano, C. Cheng, and A. Montanari · 2021
Later among the works it cites.
Convex and nonconvex optimization are both minimax-optimal for noisy blind deconvolution under random designs
Y. Chen, J. Fan, B. Wang, and Y. Yan · 2021
Later among the works it cites.
Concentration inequalities for polynomials in α \alpha -sub-exponential random variables
F. Götze, H. Sambale, and A. Sinulis · 2021
Later among the works it cites.
Tensor methods for nonlinear matrix completion
G. Ongie, D. Pimentel-Alarcón, L. Balzano, R. Willett, and R. D. Nowak · 2021
Later among the works it cites.
Single-index models in the high signal regime
A. Pananjady and D. P. Foster · 2021
Later among the works it cites.
Dynamics of stochastic momentum methods on large-scale, quadratic models
C. Paquette and E. Paquette · 2021
Later among the works it cites.
SGD in the large: Average-case analysis, asymptotics, and stepsize criticality
C. Paquette, K. Lee, F. Pedregosa, and E. Paquette · 2021
Later among the works it cites.
Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction
D. Stöger and M. Soltanolkotabi · 2021
Later among the works it cites.
Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in O ( n ) {O}(\sqrt{n}) iterations
Y. Wu and H. H. Zhou · 2021
Later among the works it cites.
Universality of empirical risk minimization
A. Montanari and B. N. Saeed · 2022
Closest in time.
Provable nonconvex methods/algorithms, 2022
J. Sun · 2022
Closest in time.
Sharp global convergence guarantees for iterative nonconvex optimization with random data
K. A. Chandrasekher, A. Pananjady, and C. Thrampoulidis · 2023
Closest in time.
Stochastic algorithms with geometric step decay converge linearly on sharp functions
D. Davis, D. Drusvyatskiy, and V. Charisopoulos · 2023
Closest in time.
Algorithmic regularization in model-free overparametrized asymmetric matrix factorization
L. Jiang, Y. Chen, and L. Ding · 2023
Closest in time.
Randomly initialized alternating least squares: Fast convergence for matrix sensing
K. Lee and D. Stöger · 2023
Closest in time.