Greedy Causal Discovery is Geometric
贪婪因果发现的几何结构
Finding a directed acyclic graph (DAG) that best encodes the conditional independence statements observable from data is a central question within causality. Algorithms that greedily transform one candidate DAG into another given a fixed set of moves have been particularly successful, for example the GES, GIES, and MMHC algorithms. In 2010, Studený, Hemmecke and Lindner introduced the characteristic imset polytope, $\operatorname{CIM}_p$, whose vertices correspond to Markov…