Learning linear acyclic causal model including Gaussian noise using ancestral relationships
<|reference_start|>Learning linear acyclic causal model including Gaussian noise using ancestral relationships: This paper discusses algorithms for learning causal DAGs. The PC algorithm makes no assumptions other than the faithfulness to the causal model and can identify only up to the Markov equivalence class. LiNGAM assumes linearity and continuous non-Gaussian disturbances for the causal model, and the causal DAG defining LiNGAM is shown to be fully identifiable. The PC-LiNGAM, a hybrid of the PC algorithm and LiNGAM, can identify up to the distribution-equivalence pattern of a linear causal model, even in the presence of Gaussian disturbances. However, in the worst case, the PC-LiNGAM has factorial time complexity for the number of variables. In this paper, we propose an algorithm for learning the distribution-equivalence patterns of a linear causal model with a lower time complexity than PC-LiNGAM, using the causal ancestor finding algorithm in Maeda and Shimizu, which is generalized to account for Gaussian disturbances.<|reference_end|>
@article{cai2024learning,
    title={Learning linear acyclic causal model including Gaussian noise using
  ancestral relationships},
    author={Ming Cai and Penggang Gao and Hisayuki Hara},
    journal={arXiv preprint arXiv:2409.00417},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.00417},
    primaryClass={cs.LG stat.ME}
}