Constraint-based causal discovery for non-linear structural causal models with cycles and latent confounders

34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018

Volumn 1, Issue , 2018, Pages 269-278

  Forré, Patrick ^a   Mooij, Joris M ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FUNCTIONS; SEPARATION; STOCHASTIC SYSTEMS;

ADDITIONAL STRUCTURES; CAUSAL RELATIONSHIPS; CONNECTION GRAPHS; CONSTRAINT-BASED; DISCOVERY ALGORITHM; LATENT CONFOUNDERS; MARGINALISATION; PROOF OF CONCEPT;

DIRECTED GRAPHS;

EID: 85059373905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. n -ball. Ann. Probab., 33(2): 480-513, 2005.
2. V.I. Bogachev. Measure Theory. Vol. I, II. Springer, 2007.
3. S. Bongers, J. Peters, B. Schölkopf, and J. M. Mooij. Theoretical aspects of cyclic structural causal models. arXiv.org preprint, arXiv: 1611.06221v2 [stat.ME], 2018.
4. T. Claassen and T. Heskes. Bayesian probabilities for constraint-based causal discovery. In IJCAI-13, pages 2992-2996, 2013.
5. T. Claassen, J.M. Mooij, and T. Heskes. Learning Sparse Causal Models is not NP-hard. In UAI-13, pages 172-181, 2013.
6. G. F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9: 309-347, 1992.
7. M. Drton, M. Eichler, and T. Richardson. Computing maximum likelihood estimates in recursive linear models with correlated errors. Journal of Machine Learning Research, 10: 2329-2348, 2009.
8. R. Evans and T. Richardson. Maximum likelihood fitting of acyclic directed mixed graphs to binary data. In UAI-10, 2010.
9. R.J. Evans. Graphs for margins of Bayesian networks. Scand. J. Stat., 43(3): 625-648, 2016.
10. R.J. Evans. Margins of discrete Bayesian networks. arXiv: 1501.02103, pages 1-41, 2017. Submitted to Annals of Statistics.
11. R.J. Evans and T.S. Richardson. Markovian acyclic directed mixed graphs for discrete data. Ann. Statist., 42(4): 1452-1482, 08 2014.
12. P. Forré and J. M. Mooij. Markov properties for graphical models with cycles and latent variables. arXiv: 1710.08775, 2017.
13. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Clingo = ASP + control: Extended report. Technical report, University of Potsdam, 2014. http://www.cs.uni-potsdam.de/wv/pdfformat/gekakasc14a.pdf.
14. D. Geiger and D. Heckerman. Learning Gaussian networks. In UAI-94, pages 235-243, 1994.
15. M. Gelfond. Answer sets. In Handbook of Knowledge Representation, pages 285-316. 2008.
16. I. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, 2016.
17. D. Heckerman, C. Meek, and G. Cooper. A Bayesian approach to causal discovery. In C. Glymour and G. F. Cooper, editors, Computation, Causation, and Discovery, pages 141-166. MIT Press, 1999.
18. A. Hyttinen, F. Eberhardt, and P.O. Hoyer. Causal discovery for linear cyclic models. In Proceedings of the Fifth European Workshop on Probabilistic Graphical Models, 2010.
19. A. Hyttinen, F. Eberhardt, and M. Järvisalo. Constraint-based causal discovery: Conflict resolution with answer set programming. In UAI-14, pages 340-349, 2014.
20. V. Lifschitz. What is Answer Set Programming? In AAAI Conference on Artificial Intelligence, pages 1594-1597, 2008.
21. S. Magliacane, T. Claassen, and J.M. Mooij. Ancestral causal inference. In NIPS-16, pages 4466-4474. 2016.
22. C. Meek. Strong completeness and faithfulness in Bayesian networks. In UAI-95, pages 411-418, 1995.
23. J. M. Mooij, S. Magliacane, and T. Claassen. Joint causal inference from multiple contexts. arXiv.org preprint, https://arxiv.org/abs/1611.10351v3 [cs.LG], March 2018.
24. J. Pearl. Fusion, propagation and structuring in belief networks. Technical Report 3, UCLA Computer Science Department, 1986. Technical Report 850022 (R-42).
25. J. Pearl. Causality: Models, reasoning, and inference. Cambridge University Press, 2nd edition, 2009.
26. J. Peters, D. Janzing, and B. Schölkopf. Elements of Causal Inference: Foundation and Learning Algorithms. MIT press, 2017.
27. T. Richardson. A discovery algorithm for directed cyclic graphs. In UAI-96, pages 454-461. 1996.
28. T. Richardson. Markov properties for acyclic directed mixed graphs. Scand. J. Stat., 30(1): 145-157, 2003.
29. T. Richardson and P. Spirtes. Automated discovery of linear feedback models. In C. Glymour and G. F. Cooper, editors, Computation, Causation, and Discovery, pages 253-304. MIT Press, 1999.
30. D. Rothenhäusler, C. Heinze, J. Peters, and N. Meinshausen. BACKSHIFT: Learning causal cyclic graphs from unknown shift interventions. In NIPS-15, pages 1513-1521. 2015.
31. P. Spirtes. Directed cyclic graphical representations of feedback models. In UAI-95, pages 491-499, 1995.
32. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction, and Search. MIT press, 2000.
33. T.S. Verma and J. Pearl. Causal Networks: Semantics and Expressiveness. UAI-90, 4: 69-76, 1990.
34. J. Zhang. On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias. Artificial Intelligence, 172(16-17): 1873-1896, 2008.