The Optimal Hard Threshold for Singular Values is 4/sqrt(3)

C. Eckart and G. Young, “The approximation of one matrix by another of lower rank,” Psychometrika , vol. 1, no. 3, 1936

1936

Earlier work this paper cites.

G. Golub and W. Kahan, “Calculating the Singular Values and Pseudo-Inverse of a Matrix,” Journal of the Society for Industrial & Applied Mathematics: Series B , vol. 2, no. 2, pp. 205–224, 1965

1965

Earlier work this paper cites.

R. Cattell, “The scree test for the number of factors,” Multivariate behavioral research , 1966

1966

Earlier work this paper cites.

S. Wold, “Cross-Validatory Estimation of the Number of Components in Factor and Principal Components Components Models,” Technometrics , vol. 20, no. 4, pp. 397–405, 1978. [Online]. Available: http://www.tandfonline.com/doi/pdf/10.1080/00401706.1978.10489693

1978

Earlier work this paper cites.

Y. Q. Yin, Z. D. Bai, and P. R. Krishnaiah, “On the limit of the largest eigenvalue of the large dimensional sample covariance matrix,” Probability Theory and Related Fields , vol. 78, pp. 509-–521, 1988

1988

Earlier work this paper cites.

D. Jackson, “Stopping rules in principal components analysis: a comparison of heuristical and statistical approaches,” Ecology , 1993. Available: http://www.jstor.org/stable/10.2307/1939574

1993

Earlier work this paper cites.

Y. Q. Yin, Z. D. Bai, “Limit of the smallest eigenvalue of a large dimensional sample covariance matrix,” The annals of Probability , vol. 21, no. 3, pp.1275-–1294, 1993

1993

Earlier work this paper cites.

T. D. Lagerlund, F. W. Sharbrough, and N. E. Busacker, “Spatial filtering of multichannel electroencephalographic recordings through principal component analysis by singular value decomposition.” Journal of clinical neurophysiology : official publication of the American Electroencephalographic Society , vol. 14, no. 1, pp. 73–82, Jan. 1997

1997

Earlier work this paper cites.

O. Edfors and M. Sandell, “OFDM channel estimation by singular value decomposition,” IEEE Transactions on Communications , vol. 46, no. 7, pp. 931-939, 1998

1998

Earlier work this paper cites.

O. Alter, P. Brown, and D. Botstein, “Singular value decomposition for genome-wide expression data processing and modeling,” Proceedings of the National Academy of Sciences , vol. 97, no. 18, pp. 10 101–10 106, Aug. 2000

2000

Earlier work this paper cites.

D. Achlioptas and F. McSherry, “Fast Computation of Low Rank Matrix Approximations,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing , 2001, pp. 611–618. [Online]. Available: http://dl.acm.org/citation.cfm?id=380858

2001

Earlier work this paper cites.

Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia, “Spectral Analysis of Data,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing , 2001, pp. 619–626. [Online]. Available: http://dl.acm.org/citation.cfm?id=380859

2001

Earlier work this paper cites.

I. M. Johnstone, “On the distribution of the largest eigenvalue in principal components analysis,” Annals of Statistics , vol. 29, no. 2, pp. 295–327, 2001

2001

Cited alongside, same era.

A. L. Price, N. J. Patterson, R. M. Plenge, M. E. Weinblatt, N. a. Shadick, and D. Reich, “Principal components analysis corrects for stratification in genome-wide association studies.” Nature genetics , vol. 38, no. 8, pp. 904–9, Aug. 2006

2006

Cited alongside, same era.

P. D. Hoff, “Model averaging and dimension selection for the singular value decomposition,” Sep. 2006. [Online]. Available: http://arxiv.org/abs/math/0609042

2006

Cited alongside, same era.

P. J. Bickel and E. Levina, “Covariance regularization by thresholding,” The Annals of Statistics , vol. 36, no. 6, pp. 2577–2604, Dec. 2008. [Online]. Available: http://projecteuclid.org/euclid.aos/1231165180

2008

Cited alongside, same era.

S. Chatterjee, “Matrix estimation by universal singular value thresholding,”, 2010. [Online]. Available: arxiv.org/abs/1212.1247

Original

2010

Later among the works it cites.

R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transcations on Information Theory , vol. 56, no. 6, pp.2980-2998, 2010. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5466511

2010

Later among the works it cites.

Z. Bai, and J. W. Silverstein, “Spectral Analysis of Large Dimensional Random Matrices (2nd Edition),” 2010. Springer New York. doi:10.1007/978-1-4419-0661-8

2010

Later among the works it cites.

J. Tanner and K. Wei, “Normalized iterative hard thresholding for matrix completion,” 2012. [Online]. Available: http://people.maths.ox.ac.uk/tanner/papers/TaWei_NIHT.pdf

2012

Later among the works it cites.