Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
The optimal hard threshold for singular values is 4/√3
Matan Gavish
, David L. Donoho
Research output
:
Contribution to journal
›
Article
›
peer-review
476
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The optimal hard threshold for singular values is 4/√3'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Singular Values
100%
Hard Threshold
100%
Asymptotic Mean Squared Error
66%
Hard Thresholding
50%
Truncated Singular Value Decomposition
50%
Low-rank Matrix
33%
Popular
16%
Signal-to-noise Ratio
16%
Performance Improvement
16%
Noisy Data
16%
Low-rank
16%
Noise Distribution
16%
Error Guarantee
16%
Matrix Size
16%
Soft Thresholding
16%
Nuclear Norm
16%
Threshold Rule
16%
Shrinkage Rules
16%
Unknown Noise Level
16%
Mathematics
Matrix (Mathematics)
100%
Singular Value
100%
Thresholding
75%
Asymptotics
50%
Squared Error
50%
Singular Value Decomposition
37%
Noise Ratio
12%
Optimal Choice
12%
Noisy Data
12%