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.
D-CDLF: Decomposition of Common and Distinctive Latent Factors for Multi-view High-dimensional Data
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A typical approach to the joint analysis of multiple high-dimensional data views is to decompose each view's data matrix into three parts: a low-rank common-source matrix generated by common latent factors of all data views, a low-rank distinctive-source matrix generated by distinctive latent factors of the corresponding data view, and an additive noise matrix. Existing decomposition methods often focus on the uncorrelatedness between the common latent factors and distinctive latent factors, but inadequately address the equally necessary uncorrelatedness between distinctive latent factors from different data views. We propose a novel decomposition method, called Decomposition of Common and Distinctive Latent Factors (D-CDLF), to effectively achieve both types of uncorrelatedness for two-view data. We also discuss the estimation of the D-CDLF under high-dimensional settings.
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.