Causal Compression
Aleksander Wieczorek, Volker Roth

TL;DR
This paper introduces a novel causal compression method for discovering causal relationships in temporal data using directed information and Pearlian graphs, with applications in time series segmentation and bipartite graph recovery.
Contribution
It presents a new causal inference approach based on directed information, causal sparsity, and copula density estimation, applicable to temporal data analysis.
Findings
Effective causal time series segmentation demonstrated
Successful causal bipartite graph recovery shown
Method validated on gene expression data
Abstract
We propose a new method of discovering causal relationships in temporal data based on the notion of causal compression. To this end, we adopt the Pearlian graph setting and the directed information as an information theoretic tool for quantifying causality. We introduce chain rule for directed information and use it to motivate causal sparsity. We show two applications of the proposed method: causal time series segmentation which selects time points capturing the incoming and outgoing causal flow between time points belonging to different signals, and causal bipartite graph recovery. We prove that modelling of causality in the adopted set-up only requires estimating the copula density of the data distribution and thus does not depend on its marginals. We evaluate the method on time resolved gene expression data.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems · Anomaly Detection Techniques and Applications · Machine Learning and Algorithms
