Pith. sign in

REVIEW 1 cited by

Understanding Latent Correlation-Based Multiview Learning and Self-Supervision: An Identifiability Perspective

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 2106.07115 v3 pith:5SCFGP6T submitted 2021-06-14 cs.LG cs.AIcs.CVstat.ML

classification cs.LGcs.AIcs.CVstat.ML
keywords datalearningcomponentslatentmultiviewsharedviewsanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multiple views of data, both naturally acquired (e.g., image and audio) and artificially produced (e.g., via adding different noise to data samples), have proven useful in enhancing representation learning. Natural views are often handled by multiview analysis tools, e.g., (deep) canonical correlation analysis [(D)CCA], while the artificial ones are frequently used in self-supervised learning (SSL) paradigms, e.g., BYOL and Barlow Twins. Both types of approaches often involve learning neural feature extractors such that the embeddings of data exhibit high cross-view correlations. Although intuitive, the effectiveness of correlation-based neural embedding is mostly empirically validated. This work aims to understand latent correlation maximization-based deep multiview learning from a latent component identification viewpoint. An intuitive generative model of multiview data is adopted, where the views are different nonlinear mixtures of shared and private components. Since the shared components are view/distortion-invariant, representing the data using such components is believed to reveal the identity of the samples effectively and robustly. Under this model, latent correlation maximization is shown to guarantee the extraction of the shared components across views (up to certain ambiguities). In addition, it is further shown that the private information in each view can be provably disentangled from the shared using proper regularization design. A finite sample analysis, which has been rare in nonlinear mixture identifiability study, is also presented. The theoretical results and newly designed regularization are tested on a series of tasks.

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. Provable Affine Identifiability of Nonlinear CCA under Latent Distributional Priors

    cs.LG 2025-10 conditional novelty 6.0 of 10

    Under Gaussian latent priors with first-order canonical dominance, population nonlinear CCA maximizers are affine functions of the true latents, yielding identifiability up to orthogonal transformation.

Pith tools