Scalable Time-Series Causal Discovery with Approximate Causal Ordering
Ziyang Jiao, Ce Guo, Wayne Luk

TL;DR
This paper presents a scalable heuristic approximation of the VarLiNGAM causal discovery algorithm for time-series data, significantly reducing computation time while maintaining reliability, enabling large-scale analysis on standard hardware.
Contribution
Introduces a heuristic modification of VarLiNGAM that reduces computational complexity and enables scalable causal discovery in large time-series datasets.
Findings
Achieves 7-13x speedup on large financial datasets.
Maintains empirical reliability comparable to standard VarLiNGAM.
Demonstrates robustness across diverse real-world applications.
Abstract
Causal discovery in time-series data presents a significant computational challenge. Standard algorithms are often prohibitively expensive for datasets with many variables or samples. This study introduces and validates a heuristic approximation of the VarLiNGAM algorithm to address this scalability problem. The standard VarLiNGAM method relies on an iterative search, recalculating statistical dependencies after each step. Our heuristic modifies this procedure by omitting the iterative refinement. This change permits a one-time precomputation of all necessary statistical values. The algorithmic modification reduces the time complexity from to while keeping the space complexity at , where is the number of variables and is the number of samples. While an approximation, our approach retains VarLiNGAM's essential structure and empirical reliability.…
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
TopicsTime Series Analysis and Forecasting · Bayesian Modeling and Causal Inference · Data Quality and Management
