Testing Independence Between Linear Combinations for Causal Discovery

Abstract

Recently, regression based conditional independence (CI) tests have been employed to solve the problem of causal discovery. These methods provide an alternative way to test for CI by transforming CI to independence between residuals. Generally, it is nontrivial to check for independence when these residuals are linearly uncorrelated. With the ability to represent high-order moments, kernel-based methods are usually used to achieve this goal, but at a cost of considerable time. In this paper, we investigate the independence between two linear combinations under linear non-Gaussian structural equation model (SEM). We show that generally the 1-st to 4-th moments of the two linear combinations contain enough information to infer whether or not they are independent. The proposed method provides a simpler but more effective way to measure CIs, with only calculating the 1-st to 4-th moments of the input variables. When applied to causal discovery, the proposed method outperforms kernel-based methods in terms of both speed and accuracy. which is validated by extensive experiments.

Cite

Text

Zhang et al. "Testing Independence Between Linear Combinations for Causal Discovery." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I7.16810

Markdown

[Zhang et al. "Testing Independence Between Linear Combinations for Causal Discovery." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/zhang2021aaai-testing/) doi:10.1609/AAAI.V35I7.16810

BibTeX

@inproceedings{zhang2021aaai-testing,
  title     = {{Testing Independence Between Linear Combinations for Causal Discovery}},
  author    = {Zhang, Hao and Zhang, Kun and Zhou, Shuigeng and Guan, Jihong and Zhang, Ji},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {6538-6546},
  doi       = {10.1609/AAAI.V35I7.16810},
  url       = {https://mlanthology.org/aaai/2021/zhang2021aaai-testing/}
}