[edit]
Causal Feature Learning for Utility-Maximizing Agents
Proceedings of the 10th International Conference on Probabilistic Graphical Models, PMLR 138:257-268, 2020.
Abstract
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 et al.
(2015, 2016a, 2016b, 2017) develop a procedure for \textit{causal
feature learning} (CFL) in an effort to 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, \textit{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.