Pith. sign in

REVIEW 1 cited by

D-CDLF: Decomposition of Common and Distinctive Latent Factors for Multi-view High-dimensional Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.00730 v2 pith:URSQZ536 submitted 2024-06-30 stat.ML cs.LG

classification stat.MLcs.LG
keywords datafactorslatentdistinctivecommondecompositionmatrixd-cdlf
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matrices

    math.ST 2024-11 conditional novelty 7.0 of 10

    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 stro...

Pith tools