Pith. sign in

REVIEW 2 cited by

A Sparsity Principle for Partially Observable Causal Representation Learning

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 2403.08335 v2 pith:GA7D3C5B submitted 2024-03-13 cs.LG cs.AIstat.ML

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

Causal representation learning aims at identifying high-level causal variables from perceptual data. Most methods assume that all latent causal variables are captured in the high-dimensional observations. We instead consider a partially observed setting, in which each measurement only provides information about a subset of the underlying causal state. Prior work has studied this setting with multiple domains or views, each depending on a fixed subset of latents. Here, we focus on learning from unpaired observations from a dataset with an instance-dependent partial observability pattern. Our main contribution is to establish two identifiability results for this setting: one for linear mixing functions without parametric assumptions on the underlying causal model, and one for piecewise linear mixing functions with Gaussian latent causal variables. Based on these insights, we propose two methods for estimating the underlying causal variables by enforcing sparsity in the inferred representation. Experiments on different simulated datasets and established benchmarks highlight the effectiveness of our approach in recovering the ground-truth latents.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Enforcing local orthogonality on the Jacobian of the generative mapping yields identifiability for general nonlinear models when the latent domain has full combinatorial support.

  2. MoVA: Learning Asymmetric Dual Projections for Modular Long Video-Text Alignment

    cs.CV 2026-07 unverdicted novelty 5.0 of 10

    MoVA introduces modular asymmetric dual projections to handle temporal misalignment and semantic asymmetry in long video-text alignment.

Pith tools