共 50 条
Causal Learning with Occam's Razor
被引:2
|作者:
Schulte, Oliver
[1
]
机构:
[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
基金:
加拿大自然科学与工程研究理事会;
关键词:
Causal graph;
Bayesian network;
Formal learning theory;
Mind change bounds;
Probabilistic clauses;
BAYESIAN NETWORKS;
IDENTIFICATION;
D O I:
10.1007/s11225-018-9829-1
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Occam's razor directs us to adopt the simplest hypothesis consistent with the evidence. Learning theory provides a precise definition of the inductive simplicity of a hypothesis for a given learning problem. This definition specifies a learning method that implements an inductive version of Occam's razor. As a case study, we apply Occam's inductive razor to causal learning. We consider two causal learning problems: learning a causal graph structure that presents global causal connections among a set of domain variables, and learning context-sensitive causal relationships that hold not globally, but only relative to a context. For causal graph learning, Occam's inductive razor directs us to adopt the model that explains the observed correlations with a minimum number of direct causal connections. For expanding a causal graph structure to include context-sensitive relationships, Occam's inductive razor directs us to adopt the expansion that explains the observed correlations with a minimum number of free parameters. This is equivalent to explaining the correlations with a minimum number of probabilistic logical rules. The paper provides a gentle introduction to the learning-theoretic definition of inductive simplicity and the application of Occam's razor for causal learning.
引用
收藏
页码:991 / 1023
页数:33
相关论文