Pith. sign in

REVIEW 2 cited by

Identifiable Causal Representation Learning: Unsupervised, Multi-View, and Multi-Environment

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 2406.13371 v1 pith:IY6DHLGR submitted 2024-06-19 cs.LG cs.AIstat.ML

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

Causal models provide rich descriptions of complex systems as sets of mechanisms by which each variable is influenced by its direct causes. They support reasoning about manipulating parts of the system and thus hold promise for addressing some of the open challenges of artificial intelligence (AI), such as planning, transferring knowledge in changing environments, or robustness to distribution shifts. However, a key obstacle to more widespread use of causal models in AI is the requirement that the relevant variables be specified a priori, which is typically not the case for the high-dimensional, unstructured data processed by modern AI systems. At the same time, machine learning (ML) has proven quite successful at automatically extracting useful and compact representations of such complex data. Causal representation learning (CRL) aims to combine the core strengths of ML and causality by learning representations in the form of latent variables endowed with causal model semantics. In this thesis, we study and present new results for different CRL settings. A central theme is the question of identifiability: Given infinite data, when are representations satisfying the same learning objective guaranteed to be equivalent? This is an important prerequisite for CRL, as it formally characterises if and when a learning task is, at least in principle, feasible. Since learning causal models, even without a representation learning component, is notoriously difficult, we require additional assumptions on the model class or rich data beyond the classical i.i.d. setting. By partially characterising identifiability for different settings, this thesis investigates what is possible for CRL without direct supervision, and thus contributes to its theoretical foundations. Ideally, the developed insights can help inform data collection practices or inspire the design of new practical estimation methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Unregistered Spectral Image Fusion: Unmixing, Adversarial Learning, and Recoverability

    eess.IV 2026-03 conditional novelty 7.0 of 10

    Unregistered HSI-MSI pairs can be jointly super-resolved without training data or co-registration by coupled block-term unmixing plus multi-abundance adversarial translation, with almost-sure recoverability under low-...

  2. Rethinking Spatio-Temporal Anomaly Detection: A Vision for Causality-Driven Cybersecurity

    cs.LG 2025-07 unverdicted novelty 4.0 of 10

    The paper is a position piece advocating causal graph learning as the basis for interpretable, drift-robust anomaly detection in cyber-physical systems, with a small comparison table as supporting evidence.

Pith tools