Stack-SVD is minimax optimal for fully shared singular subspaces; with partial sharing, rate-optimal estimation requires locating shared vectors, and the proposed tracing algorithm does so under orthogonality and strong-signal conditions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matrices
Stack-SVD is minimax optimal for fully shared singular subspaces; with partial sharing, rate-optimal estimation requires locating shared vectors, and the proposed tracing algorithm does so under orthogonality and strong-signal conditions.