The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
The Optimal Hard Threshold for Singular Values is \(4/\sqrt {3}\)
Open accessAbstract
We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, in which empirical singular values below a threshold λ are set to 0. We study the asymptotic mean squared error (AMSE) in a framework, where the matrix size is large compared with the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-optimal choice of hard threshold, in the case of n-by-n matrix in white noise of level σ, is simply (4/√3)√nσ ≈ 2.309√nσ when σ is known, or simply 2.858 · ymedwhen σ is unknown, where ymedis the median empirical singular value. For nonsquare, m by n matrices with m ≠ n the thresholding coefficients 4/√3 and 2.858 are replaced with different provided constants that depend on m/n. Asymptotically, this thresholding rule adapts to unknown rank and unknown noise level in an optimal manner: it is always better than hard thresholding at any other value, and is always better than ideal truncated singular value decomposition (TSVD), which truncates at the true rank of the low-rank matrix we are trying to recover. Hard thresholding at the recommended value to recover an n-by-n matrix of rank r guarantees an AMSE at most 3 nrσ2. In comparison, the guarantees provided by TSVD, optimally tuned singular value soft thresholding and the best guarantee achievable by any shrinkage of the data singular values are 5 nrσ2, 6 nrσ2, and 2 nrσ2, respectively. The recommended value for hard threshold also offers, among hard thresholds, the best possible AMSE guarantees for recovering matrices with bounded nuclear norm. Empirical evidence suggests that performance improvement over TSVD and other popular shrinkage rules can be substantial, for different noise distributions, even in relatively small n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Scree Test For The Number Of Factors
Cattell, R. B. (1966) · Multivariate Behavioral Research · doi:10.1207/s15327906mbr0102_10 · Cited by 13,554
Principal components analysis corrects for stratification in genome-wide association studies
Price, A. L., Patterson, N. J., Plenge, R. M., Weinblatt, M. E., Shadick, N. A., & Reich, D. (2006) · Nature Genetics · doi:10.1038/ng1847 · Cited by 10,248
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Cross-Validatory Estimation of the Number of Components in Factor and Principal Components Models
Wold, S. (1978) · Technometrics · doi:10.1080/00401706.1978.10489693 · Cited by 2,601
Jackson, D. A. (1993) · Ecology · doi:10.2307/1939574 · Cited by 2,298
Singular value decomposition for genome-wide expression data processing and modeling
Alter, O., Brown, P. O., & Botstein, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.18.10101 · Cited by 1,971
On the distribution of the largest eigenvalue in principal components analysis
Johnstone, I. M. (2001) · The Annals of Statistics · doi:10.1214/aos/1009210544 · Cited by 1,949
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
Spectral Analysis of Large Dimensional Random Matrices
Bai, Z., & Silverstein, J. W. (2010) · Springer Series in Statistics · doi:10.1007/978-1-4419-0661-8 · Cited by 1,544
Cited by
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1517384113 · Cited by 4,796
Data-driven discovery of partial differential equations
Rudy, S. H., Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2017) · Science Advances · doi:10.1126/sciadv.1602614 · Cited by 1,557
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Universality and diversity in human song
Mehr, S. A., Singh, M., Knox, D., Ketter, D. M., Pickens-Jones, D., Atwood, S., Lucas, C., Jacoby, N., Egner, A. A., Hopkins, E. J., et al. (2019) · Science · doi:10.1126/science.aax0868 · Cited by 660
Chaos as an intermittently forced linear system
Brunton, S. L., Brunton, B. W., Proctor, J. L., Kaiser, E., & Kutz, J. N. (2017) · Nature Communications · doi:10.1038/s41467-017-00030-8 · Cited by 608
Mathematics for Machine Learning
Deisenroth, M. P., Faisal, A. A., & Ong, C. S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108679930 · Cited by 573
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
Brunton, B. W., Johnson, L. A., Ojemann, J. G., & Kutz, J. N. (2016) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2015.10.010 · Cited by 470
Matrix estimation by Universal Singular Value Thresholding
Chatterjee, S. (2015) · The Annals of Statistics · doi:10.1214/14-aos1272 · Cited by 465
Multiresolution Dynamic Mode Decomposition
Kutz, J. N., Fu, X., & Brunton, S. L. (2016) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/15m1023543 · Cited by 442
Inferring biological networks by sparse identification of nonlinear dynamics
Mangan, N. M., Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016) · IEEE Transactions on Molecular, Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2016.2633265 · Cited by 436
Complex diffusion-weighted image estimation via matrix recovery under general noise models
Cordero-Grande, L., Christiaens, D., Hutter, J., Price, A. N., & Hajnal, J. V. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.06.039 · Cited by 354
Vidal, R., Ma, Y., & Sastry, S. S. (2016) · Interdisciplinary Applied Mathematics · doi:10.1007/978-0-387-87811-9_2 · Cited by 324
SINDy-PI: a robust algorithm for parallel implicit sparse identification of nonlinear dynamics
Kaheman, K., Kutz, J. N., & Brunton, S. L. (2020) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2020.0279 · Cited by 276
Data-Driven Aerospace Engineering: Reframing the Industry with Machine Learning
Brunton, S. L., Nathan Kutz, J., Manohar, K., Aravkin, A. Y., Morgansen, K., Klemisch, J., Goebel, N., Buttrick, J., Poskin, J., Blom-Schieber, A. W., et al. (2021) · AIAA Journal · doi:10.2514/1.j060131 · Cited by 270
An Efficient Statistical Method for Image Noise Level Estimation
Chen, G., Zhu, F., & Heng, P. A. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.62 · Cited by 267
Chiang, C.-H., Won, S. M., Orsborn, A. L., Yu, K. J., Trumpis, M., Bent, B., Wang, C., Xue, Y., Min, S., Woods, V., et al. (2020) · Science Translational Medicine · doi:10.1126/scitranslmed.aay4682 · Cited by 211
Rapid fluctuations in functional connectivity of cortical networks encode spontaneous behavior
Benisty, H., Barson, D., Moberly, A. H., Lohani, S., Tang, L., Coifman, R. R., Crair, M. C., Mishne, G., Cardin, J. A., & Higley, M. J. (2024) · Nature Neuroscience · doi:10.1038/s41593-023-01498-y · Cited by 65
Biwhitening Reveals the Rank of a Count Matrix
Landa, B., Zhang, T. T. C. K., & Kluger, Y. (2022) · SIAM Journal on Mathematics of Data Science · doi:10.1137/21m1456807 · Cited by 20
Echols, J. T., Wang, S., Patel, A. R., Hogwood, A. C., Abbate, A., & Epstein, F. H. (2025) · Magnetic Resonance in Medicine · doi:10.1002/mrm.30285 · Cited by 9
Metadata
- Authors
- Gavish, M., & Donoho, D. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-08
- Volume
- 60
- Issue
- 8
- Pages
- 5040-5053
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2963780177
- Cited by
- 675
- References
- 32
- FWCI
- 24.24
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.