Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

ParceLiNGAM: A causal ordering method robust against latent confounders (1303.7410v2)

Published 29 Mar 2013 in stat.ML

Abstract: We consider learning a causal ordering of variables in a linear non-Gaussian acyclic model called LiNGAM. Several existing methods have been shown to consistently estimate a causal ordering assuming that all the model assumptions are correct. But, the estimation results could be distorted if some assumptions actually are violated. In this paper, we propose a new algorithm for learning causal orders that is robust against one typical violation of the model assumptions: latent confounders. The key idea is to detect latent confounders by testing independence between estimated external influences and find subsets (parcels) that include variables that are not affected by latent confounders. We demonstrate the effectiveness of our method using artificial data and simulated brain imaging data.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Tatsuya Tashiro (2 papers)
  2. Shohei Shimizu (34 papers)
  3. Aapo Hyvarinen (56 papers)
  4. Takashi Washio (21 papers)
Citations (63)

Summary

We haven't generated a summary for this paper yet.