Papers › Optimal cleaning for singular values of cross-covariance matrices
Optimal cleaning for singular values of cross-covariance matrices
Florent Benaych-Georges, Jean-Philippe Bouchaud, Marc Potters
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We give a new algorithm for the estimation of the cross-covariance matrix 𝔼 XY′ of two large dimensional signals X∈ℝⁿ, Y∈ℝᵖ in the context where the number T of observations of the pair (X,Y) is large but n/T and p/T are not supposed to be small. In the asymptotic regime where n,p,T are large, with high probability, this algorithm is optimal for the Frobenius norm among rotationally invariant estimators, i.e. estimators derived from the empirical estimator by cleaning the singular values, while letting singular vectors unchanged.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections