Discovering Cyclic Causal Models by Independent Components Analysis
published: Feb. 27, 2008, recorded: February 2008, views: 582
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This talk will start by presenting Shimizu et al's (2006) ICA-based approach (LiNGAM) for discovering acyclic (DAG) linear Structural Equation Models (SEMs) from causally sufficient, continuous-valued observational data. This is remarkable because it determines the direction of every causal arrow when no experimental data is available. Our work generalizes the above. By relaxing the acyclicity constraint, our approach, LiNG-DG, enables the discovery of arbitrary directed graph (DG) linear SEMs. We present various algorithm sketches for causal discovery with LiNG-DG, and show results of simulation for one such algorithm. When the error terms are non-Gaussian, LiNG-DG discovery algorithms output a smaller set of candidate SEMs than Richardson's Cyclic Causal Discovery (CCD) algorithm. We prove that all the models output by LiNG-DG entail the same observational distribution and are equally simple (i.e. same number of edges). This implies that without further assumptions, no algorithm can reliably narrow the set of candidate SEMs output by LiNG-DG using just observational data. However, we show that under the additional assumption of "stability", the set of candidate models output by LiNG-DG can be further narrowed down (under some conditions, to a single model).
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !