pith. sign in

arxiv: 1206.3273 · v1 · pith:43DRVM5Bnew · submitted 2012-06-13 · 💻 cs.AI · stat.ME

Discovering Cyclic Causal Models by Independent Components Analysis

classification 💻 cs.AI stat.ME
keywords discoverylingsemsacyclicclassdatadiscoveringdistribution
0
0 comments X
read the original abstract

We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, continuous-valued observational data. By relaxing the assumption that the generating SEM's graph is acyclic, we solve the more general problem of linear non-Gaussian (LiNG) SEM discovery. LiNG discovery algorithms output the distribution equivalence class of SEMs which, in the large sample limit, represents the population distribution. We apply a LiNG discovery algorithm to simulated data. Finally, we give sufficient conditions under which only one of the SEMs in the output class is 'stable'.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SCOUT: Cyclic Causal Discovery Under Soft Interventions with Unknown Targets

    cs.LG 2026-05 unverdicted novelty 6.0

    SCOUT recovers nonlinear cyclic causal graphs and unknown soft intervention targets from interventional data using contractive residual flows and neural spline flows to maximize log-likelihood.