Truncating Singular Values Below the Noise Level

Let W = S+R, where S is an N × M matrix of fixed rank and R has independent N(0,1/N) entries, with M/N → c ∈ (0,∞), so that ‖R‖ → 1+√c. Let W_T keep the singular values of W above a cutoff T>1+√c and set the others to zero. Each singular value θ>c^(1/4) of S produces a singular value of W near y(θ) = √((θ²+1)(θ²+c))/θ. When the singular values of S are distinct and no θ>c^(1/4) satisfies y(θ) = T, the almost sure limit of ‖W_T-S‖, which the argument of Gavish and Donoho gives from results of Benaych-Georges and Nadakuditi, is the largest of several numbers, one for each singular value of S. We show that the number belonging to a θ>c^(1/4) with y(θ)>T is less than 1+√c, whatever its size. Hence the limit, and the limits of ‖(W_T-S)v‖ and ‖u^T(W_T-S)‖ for the singular vectors u, v of S, are below 1+√c if and only if every singular value θ ≥ 1+√c of S has y(θ)>T. For every cutoff in (1+√c, y(1+√c)) the limit of ‖W_T-S‖ is below 1+√c for every such S, with a bound that does not depend on S; for every cutoff above y(1+√c) some S of rank one gives a limit above 1+√c. The interval, (2,5/2) for square matrices, contains the cutoff that Gavish and Donoho found optimal for the mean squared error. For Gaussian noise this answers a question of Berlyand, Sandier, Shmalo and Zhang on truncating random weight matrices.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24371055
Primary Topic
Random Matrices and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Truncating Singular Values Below the Noise Level

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Random Matrices and Applications
preprint

Truncating Singular Values Below the Noise Level

Yitzchak Shmalo
preprint en

Abstract

Let W = S+R, where S is an N × M matrix of fixed rank and R has independent N(0,1/N) entries, with M/N → c ∈ (0,∞), so that ‖R‖ → 1+√c. Let W_T keep the singular values of W above a cutoff T>1+√c and set the others to zero. Each singular value θ>c^(1/4) of S produces a singular value of W near y(θ) = √((θ²+1)(θ²+c))/θ. When the singular values of S are distinct and no θ>c^(1/4) satisfies y(θ) = T, the almost sure limit of ‖W_T-S‖, which the argument of Gavish and Donoho gives from results of Benaych-Georges and Nadakuditi, is the largest of several numbers, one for each singular value of S. We show that the number belonging to a θ>c^(1/4) with y(θ)>T is less than 1+√c, whatever its size. Hence the limit, and the limits of ‖(W_T-S)v‖ and ‖u^T(W_T-S)‖ for the singular vectors u, v of S, are below 1+√c if and only if every singular value θ ≥ 1+√c of S has y(θ)>T. For every cutoff in (1+√c, y(1+√c)) the limit of ‖W_T-S‖ is below 1+√c for every such S, with a bound that does not depend on S; for every cutoff above y(1+√c) some S of rank one gives a limit above 1+√c. The interval, (2,5/2) for square matrices, contains the cutoff that Gavish and Donoho found optimal for the mean squared error. For Gaussian noise this answers a question of Berlyand, Sandier, Shmalo and Zhang on truncating random weight matrices.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon