Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
12 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
37 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Argumentative Causal Discovery (2405.11250v3)

Published 18 May 2024 in cs.AI

Abstract: Causal discovery amounts to unearthing causal relationships amongst features in data. It is a crucial companion to causal inference, necessary to build scientific knowledge without resorting to expensive or impossible randomised control trials. In this paper, we explore how reasoning with symbolic representations can support causal discovery. Specifically, we deploy assumption-based argumentation (ABA), a well-established and powerful knowledge representation formalism, in combination with causality theories, to learn graphs which reflect causal dependencies in the data. We prove that our method exhibits desirable properties, notably that, under natural conditions, it can retrieve ground-truth causal graphs. We also conduct experiments with an implementation of our method in answer set programming (ASP) on four datasets from standard benchmarks in causal discovery, showing that our method compares well against established baselines.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. 2002. A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence 34:197–215.
  2. 2018. Abstract argumentation frameworks and their semantics. In Baroni, P.; Gabbay, D.; Giacomin, M.; and van der Torre, L., eds., Handbook of Formal Argumentation. College Publications.
  3. Berger, J. O. 2003. Could fisher, jeffreys and neyman have agreed on testing? Statistical Science 18(1):1–32.
  4. 2009. Improving the reliability of causal discovery from small data sets using argumentation. J. Mach. Learn. Res. 10:301–340.
  5. 2015. On the difference between assumption-based argumentation and abstract argumentation. FLAP 2(1):15–34.
  6. Chickering, D. M. 2002. Learning equivalence classes of bayesian-network structures. Journal of Machine Learning Research 2:445–498.
  7. 2012. A bayesian approach to constraint based causal inference. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, Catalina Island, CA, USA, August 14-18, 2012, UAI 2012, 207–216. AUAI Press.
  8. 2014. Order-independent constraint-based causal structure learning. Journal of Machine Learning Research 15(1):3741–3782.
  9. 2012. Learning high-dimensional directed acyclic graphs with latent and selection variables. The Annals of Statistics 40(1):294–321.
  10. 2013. Learning chordal markov networks by constraint satisfaction. Advances in Neural Information Processing Systems 26.
  11. 2018. Assumption-based argumentation: Disputes, explanations, preferences. In Baroni, P.; Gabbay, D.; Giacomin, M.; and van der Torre, L., eds., Handbook of Formal Argumentation. College Publications. chapter 7, 365–408.
  12. Fisher, R. A. 1970. Statistical methods for research workers. In Breakthroughs in statistics: Methodology and distribution. Springer. 66–70.
  13. 2017. Multi-shot ASP solving with clingo. CoRR abs/1705.09811.
  14. 2011. Complex optimization in answer set programming. TPLP 11(4-5):821–839.
  15. 2019. Review of causal discovery methods based on graphical models. Frontiers in genetics 10:524.
  16. 2007. A kernel statistical test of independence. In Proceedings of the 21st Annual Conference on Neural Information Processing Systems, 2007, NeurIPS 2007, Vancouver, British Columbia, Canada, December 3-6, 2007, 585–592. Curran Associates, Inc.
  17. 1997. The behavior of the p-value when the alternative hypothesis is true. Biometrics 53(1):11–22.
  18. 2014. Constraint-based causal discovery: conflict resolution with answer set programming. In Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, UAI’14, 340–349. Arlington, Virginia, USA: AUAI Press.
  19. 2017. Discovery of causal models that contain latent variables through bayesian scoring of independence constraints. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18–22, 2017, Proceedings, Part II 10, 142–157. Springer.
  20. 2022. Just a matter of perspective. In Toni, F.; Polberg, S.; Booth, R.; Caminada, M.; and Kido, H., eds., Computational Models of Argument - Proceedings of COMMA 2022, Cardiff, Wales, UK, 14-16 September 2022, volume 353 of Frontiers in Artificial Intelligence and Applications, 212–223. IOS Press.
  21. 2020. Gradient-based neural DAG learning. In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. OpenReview.net.
  22. 2006. A generalization of dung’s abstract framework for argumentation: Arguing with sets of attacking arguments. In Proc. ArgMAS’06, volume 4766 of LNCS, 54–73. Springer.
  23. 1986. Graphoids: Graph-based logic for reasoning about relevance relations orwhen would x tell you more about y if you already know z? Probabilistic and Causal Inference.
  24. Pearl, J. 2009. Causality. Cambridge University Press, 2 edition.
  25. 2015. Structural intervention distance for evaluating causal graphs. Neural computation 27(3):771–799.
  26. 2017. Elements of causal inference: foundations and learning algorithms. The MIT Press.
  27. Philippe Besnard, A. H. 2018. A review of argumentation based on deductive arguments. In Baroni, P.; Gabbay, D.; Giacomin, M.; and van der Torre, L., eds., Handbook of Formal Argumentation. College Publications.
  28. 2017. A million variables and more: the fast greedy equivalence search algorithm for learning high-dimensional graphical causal models, with an application to functional magnetic resonance images. International journal of data science and analytics 3:121–129.
  29. 2006. Adjacency-faithfulness and conservative causal inference. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI 2006, 401–408. Arlington, Virginia, USA: AUAI Press.
  30. 2020. Discovering causal graphs with cycles and latent confounders: An exact branch-and-bound approach. Int. J. Approx. Reason. 117:29–49.
  31. 2024. On the correspondence of non-flat assumption-based argumentation and logic programming with negation as failure in the head. CoRR abs/2405.09415.
  32. 1999. Automated Discovery of Linear Feedback Models. In Computation, Causation, and Discovery. AAAI Press.
  33. 2021. Toward causal representation learning. Proceedings of the IEEE 109(5):612–634.
  34. 2015. Logic programming in assumption-based argumentation revisited - semantics and graphical representation. In Bonet, B., and Koenig, S., eds., Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA, 1569–1575. AAAI Press.
  35. Scutari, M. 2014. Bayesian network repository. http://www.bnlearn.com/bnrepository.
  36. 2001. Calibration of ρ𝜌\rhoitalic_ρ values for testing precise null hypotheses. The American Statistician 55(1):62–71.
  37. 2000. Causation, prediction, and search. MIT press.
  38. 2014. Learning neighborhoods of high confidence in constraint-based causal discovery. In Probabilistic Graphical Models: 7th European Workshop, PGM 2014, Utrecht, The Netherlands, September 17-19, 2014. Proceedings 7, 487–502. Springer.
  39. 2006. The max-min hill-climbing bayesian network structure learning algorithm. Machine learning 65:31–78.
  40. 2024. Non-flat ABA is an instance of bipolar argumentation. In Wooldridge, M. J.; Dy, J. G.; and Natarajan, S., eds., Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, 10723–10731. AAAI Press.
  41. 2022. D’ya like dags? a survey on structure learning and causal discovery. ACM Computing Surveys 55(4):1–36.
  42. 2022. A survey on causal discovery: Theory and practice. International Journal of Approximate Reasoning 151:101–129.
  43. 2011. Kernel-based conditional independence test and application in causal discovery. In Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14-17, 2011, UAI 2011, 804–813. AUAI Press.
  44. 2018. Dags with NO TEARS: continuous optimization for structure learning. In Prooceedings of the 31st Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montréal, Canada, 9492–9503.
  45. 2020. Learning sparse nonparametric dags. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, 3414–3425. PMLR.
Citations (1)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now