Fetching the paper…
Reading the bibliography…
We study a spectral initialization method that serves a key role in recent work on estimating signals in nonconvex settings.
V. A. Marčenko and L. A. Pastur, “Distribution of eigenvalues for some sets of random matrices,” Mathematics of the USSR-Sbornik , vol. 1, no. 4, p. 457, 1967
1967
Earlier work this paper cites.
J. R. Fienup, “Phase retrieval algorithms: a comparison,” Applied Optics , vol. 21, no. 15, pp. 2758–2769, 1982
1982
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix Analysis . Cambridge, UK: Cambridge University Press, 1985
1985
Earlier work this paper cites.
M. Unser and M. Eden, “Maximum likelihood estimation of linear signal parameters for Poisson processes,” IEEE Trans. Acoust., Speech, and Signal Process. , vol. 36, no. 6, pp. 942–945, Jun. 1988
1988
Earlier work this paper cites.
J. H. Wilkinson, The Algebraic Eigenvalue Problem . Oxford, UK: Clarendon Press, Apr. 1988
1988
Earlier work this paper cites.
D. P. O’Leary and G. W. Stewart, “Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices,” Journal of Computational Physics , vol. 90, no. 2, pp. 497–505, Oct. 1990
1990
Earlier work this paper cites.
K.-C. Li, “On principal hessian directions for data visualization and dimension reduction: Another application of Stein’s lemma,” J. Am. Stat. Assoc , vol. 87, no. 420, pp. 1025–1039, 1992
1992
Earlier work this paper cites.
J. W. Silverstein and Z. D. Bai, “On the empirical distribution of eigenvalues of a class of large dimensional random matrices,” Journal of Multivariate analysis , vol. 54, no. 2, pp. 175–192, 1995
1995
Earlier work this paper cites.
J. W. Silverstein and S. I. Choi, “Analysis of the Limiting Spectral Distribution of Large Dimensional Random Matrices,” Journal of Multivariate Analysis , vol. 54, no. 2, pp. 295–309, Aug. 1995
1995
Earlier work this paper cites.
D. A. Harville, Matrix Algebra from a Statistician’s Perspective . Springer, 2000
2000
Earlier work this paper cites.
S. Rangan and V. K. Goyal, “Recursive consistent estimation with bounded noise,” Information Theory, IEEE Transactions on , vol. 47, no. 1, pp. 457–464, 2001
2001
Earlier work this paper cites.
I. M. Johnstone, “On the distribution of the largest eigenvalue in principal components analysis,” The Annals of Statistics , vol. 29, no. 2, pp. 295–327, Apr. 2001
2001
Earlier work this paper cites.
E. L. Lehmann and G. Casella, Theory of Point Estimation , 2nd ed. New York: Springer, Sep. 2003
2003
Earlier work this paper cites.
J. Baik, G. B. Arous, and S. Péché, “Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices,” The Annals of Probability , vol. 33, no. 5, pp. 1643–1697, Sep. 2005
2005
Earlier work this paper cites.
A. J. Dobson and A. Barnett, An Introduction to Generalized Linear Models , 3rd ed. Boca Raton: Chapman and Hall/CRC, May 2008
2008
Earlier work this paper cites.
Z. Bai and J.-F. Yao, “Central limit theorems for eigenvalues in a spiked population model,” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques , vol. 44, no. 3, pp. 447–474, Jun. 2008
2008
Earlier work this paper cites.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Trans. Inf. Theory , vol. 56, no. 6, pp. 2980–2998, Jun. 2010
2010
Earlier work this paper cites.
Z. Bai and J. W. Silverstein, Spectral Analysis of Large Dimensional Random Matrices , ser. Springer Series in Statistics. New York, NY: Springer New York, 2010
2010
Cited alongside, same era.
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition , 2nd ed. New York, NY: Springer, Apr. 2011
2011
Cited alongside, same era.
F. Benaych-Georges and R. R. Nadakuditi, “The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices,” Advances in Mathematics , vol. 227, no. 1, pp. 494–521, May 2011
2011
Cited alongside, same era.
F. Yang, Y. M. Lu, L. Sbaiz, and M. Vetterli, “Bits from photons: Oversampled image acquisition using binary poisson statistics,” IEEE Trans. Image Process. , vol. 21, no. 4, pp. 1421–1436, 2012
2012
Cited alongside, same era.
H. Zhang and Y. Liang, “Reshaped Wirtinger Flow for Solving Quadratic System of Equations,” in Advances in Neural Information Processing Systems , 2016, pp. 2622–2630
2016
Later among the works it cites.
2016
Later among the works it cites.
Y. Chi and Y. M. Lu, “Kaczmarz method for solving quadratic equations,” IEEE Signal Process. Lett. , vol. 23, no. 9, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. D. Bai and J. Yao, “On sample eigenvalues in a generalized spiked population model,” Journal of Multivariate Analysis , vol. 106, no. 167–177, 2012
2012
Cited alongside, same era.
R. Vershynin, “Introduction to the non-asymptotic analysis of random matrices,” in Compressed Sensing: Theory and Applications , Y. C. Eldar and G. Kutyniok, Eds. Cambridge, UK: Cambridge University Press, 2012, pp. 210 – 268
2012
Cited alongside, same era.
E. J. Candes, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , vol. 66, no. 8, pp. 1241–1274, 2013
2013
Cited alongside, same era.
K. Jaganathan, S. Oymak, and B. Hassibi, “Sparse phase retrieval: Convex algorithms and limitations,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on . IEEE, 2013, pp. 1022–1026
2013
Cited alongside, same era.
P. Netrapalli, P. Jain, and S. Sanghavi, “Phase retrieval using alternating minimization,” in Advances in Neural Information Processing Systems , 2013, pp. 2796–2804
2013
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proc. ACM Symposium on Theory of Computing (STOC) , Palo Alto, USA, Jun 2013, pp. 665–674
2013
Cited alongside, same era.
E. J. Candes and X. Li, “Solving quadratic equations via PhaseLift when there are about as many equations as unknowns,” Foundations of Computational Mathematics , vol. 14, no. 5, pp. 1017–1026, 2014
2014
Cited alongside, same era.
I. Waldspurger, A. d’Aspremont, and S. Mallat, “Phase recovery, maxcut and complex semidefinite programming,” Mathematical Programming , vol. 149, no. 1-2, pp. 47–81, 2015
2015
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
S. Tu, R. Boczar, M. Simchowitz, M. Soltanolkotabi, and B. Recht, “Low-rank solutions of linear matrix equations via procrustes flow,” in Proc. International Confernece on Machine Learning (ICML) , New York, NY, Jun 2016
2016
Later among the works it cites.
2017
Closest in time.
O. Dhifallah and Y. M. Lu, “Fundamental limits of PhaseMax for phase retrieval: A replica analysis,” in Proc. 7th IEEE Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) , 2017
2017
Closest in time.
K. Lee, Y. Li, M. Junge, and Y. Bresler, “Blind recovery of sparse signals from subsampled convolution,” IEEE Trans. Inf. Theory , vol. 63, no. 2, pp. 802–821, Feb. 2017
2017
Closest in time.
2017
Closest in time.
Y. M. Lu and G. Li, “Spectral initialization for nonconvex estimation: High-Dimensional limit and phase transitions,” in Proc. IEEE International Symposium on Information Theory , 2017
2017
Closest in time.
2017
Closest in time.
Y. Plan, R. Vershynin, and E. Yudovina, “High-dimensional estimation with geometric constraints,” Information and Inference: A Journal of the IMA , vol. 6, no. 1, pp. 1–40, Mar. 2017
2017
Closest in time.
2018
Closest in time.
W. Luo, W. Alghamdi, and Y. M. Lu, “Optimal spectral initialization for signal recovery with applications to phase retrieval,” IEEE Trans. Signal Process. , vol. 67, no. 9, pp. 2347–2356, Mar. 2019
2019
Closest in time.