Timezone: »

Likelihood-Free Overcomplete ICA and Applications In Causal Discovery
Chenwei DING · Mingming Gong · Kun Zhang · Dacheng Tao

Tue Dec 10 10:45 AM -- 12:45 PM (PST) @ East Exhibition Hall B + C #45

Causal discovery witnessed significant progress over the past decades. In particular, many recent causal discovery methods make use of independent, non-Gaussian noise to achieve identifiability of the causal models. Existence of hidden direct common causes, or confounders, generally makes causal discovery more difficult; whenever they are present, the corresponding causal discovery algorithms can be seen as extensions of overcomplete independent component analysis (OICA). However, existing OICA algorithms usually make strong parametric assumptions on the distribution of independent components, which may be violated on real data, leading to sub-optimal or even wrong solutions. In addition, existing OICA algorithms rely on the Expectation Maximization (EM) procedure that requires computationally expensive inference of the posterior distribution of independent components. To tackle these problems, we present a Likelihood-Free Overcomplete ICA algorithm (LFOICA) that estimates the mixing matrix directly by back-propagation without any explicit assumptions on the density function of independent components. Thanks to its computational efficiency, the proposed method makes a number of causal discovery procedures much more practically feasible. For illustrative purposes, we demonstrate the computational efficiency and efficacy of our method in two causal discovery tasks on both synthetic and real data.

Author Information

Chenwei DING (The University of Sydney)
Mingming Gong (University of Melbourne)
Kun Zhang (CMU)
Dacheng Tao (University of Sydney)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors