Causal feature learning for utility-maximizing agents

In International Conference on Probabilistic Graphical Models. pp. 257–268 (2020)
Download Edit this record How to cite View on PhilPapers
Discovering high-level causal relations from low-level data is an important and challenging problem that comes up frequently in the natural and social sciences. In a series of papers, Chalupka etal. (2015, 2016a, 2016b, 2017) develop a procedure forcausal feature learning (CFL) in an effortto automate this task. We argue that CFL does not recommend coarsening in cases where pragmatic considerations rule in favor of it, and recommends coarsening in cases where pragmatic considerations rule against it. We propose a new technique, pragmatic causal feature learning (PCFL), which extends the original CFL algorithm in useful and intuitive ways. We show that PCFL has the same attractive measure-theoretic properties as the original CFL algorithm. We compare the performance of both methods through theoretical analysis and experiments.
PhilPapers/Archive ID
Upload history
Archival date: 2021-05-17
View other versions
Added to PP

41 (#67,384)

6 months
9 (#62,644)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?