REVIEW 2 cited by
Learning Temporally Causal Latent Processes from General Temporal 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
read the original abstract
Our goal is to recover time-delayed latent causal variables and identify their relations from measured temporal data. Estimating causally-related latent variables from observations is particularly challenging as the latent variables are not uniquely recoverable in the most general case. In this work, we consider both a nonparametric, nonstationary setting and a parametric setting for the latent processes and propose two provable conditions under which temporally causal latent processes can be identified from their nonlinear mixtures. We propose LEAP, a theoretically-grounded framework that extends Variational AutoEncoders (VAEs) by enforcing our conditions through proper constraints in causal process prior. Experimental results on various datasets demonstrate that temporally causal latent processes are reliably identified from observed variables under different dependency structures and that our approach considerably outperforms baselines that do not properly leverage history or nonstationarity information. This demonstrates that using temporal information to learn latent processes from their invertible nonlinear mixtures in an unsupervised manner, for which we believe our work is one of the first, seems promising even without sparsity or minimality assumptions.
Forward citations
Cited by 2 Pith papers
-
Learning General Causal Structures with Hidden Dynamic Process for Climate Analysis
CaDRe jointly recovers latent dynamic processes and observed causal graphs from time-series data, with identifiability theory and competitive climate forecasting.
-
Information Subtraction: Learning Representations for Conditional Entropy
Information Subtraction trains a generator against two mutual information estimators to represent conditional entropy H(Y|X), but the objective does not reliably remove the conditioned variable's information.
Discussion (0). Continue with ORCID to comment.