Causality Testing: A Data Compression Framework
Aditi Kathpalia, Nithin Nagaraj

TL;DR
This paper introduces a novel causality testing framework based on data compression, unifying existing methods and overcoming limitations of traditional approaches, especially in noisy and non-synchronous data.
Contribution
It proposes a generic compression-based causality testing framework and a new Compression-Complexity Causality measure that improves upon existing methods.
Findings
Outperforms Granger Causality and Transfer Entropy in noisy data
Works effectively with non-synchronous measurements
Provides insights into the nature of causal influence
Abstract
Causality testing, the act of determining cause and effect from measurements, is widely used in physics, climatology, neuroscience, econometrics and other disciplines. As a result, a large number of causality testing methods based on various principles have been developed. Causal relationships in complex systems are typically accompanied by entropic exchanges which are encoded in patterns of dynamical measurements. A data compression algorithm which can extract these encoded patterns could be used for inferring these relations. This motivates us to propose, for the first time, a generic causality testing framework based on data compression. The framework unifies existing causality testing methods and enables us to innovate a novel Compression-Complexity Causality measure. This measure is rigorously tested on simulated and real-world time series and is found to overcome the limitations…
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
TopicsAlgorithms and Data Compression · Computability, Logic, AI Algorithms · Scientific Computing and Data Management
