Bayesian random-graph model learns causal structures from interaction in two test scenarios of varying size and topology.
Probabilistic Active Learning of Functions in Structural Causal Models
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider the problem of learning the functions computing children from parents in a Structural Causal Model once the underlying causal graph has been identified. This is in some sense the second step after causal discovery. Taking a probabilistic approach to estimating these functions, we derive a natural myopic active learning scheme that identifies the intervention which is optimally informative about all of the unknown functions jointly, given previously observed data. We test the derived algorithms on simple examples, to demonstrate that they produce a structured exploration policy that significantly improves on unstructured base-lines.
fields
cs.AI 1years
2020 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Causal Structure Learning: a Bayesian approach based on random graphs
Bayesian random-graph model learns causal structures from interaction in two test scenarios of varying size and topology.