Identifying Causal Direction via Variational Bayesian Compression

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Tran, Quang-Duy, Duong, Bao, Nguyen, Phuoc, Nguyen, Thin
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908488997797888
author Tran, Quang-Duy
Duong, Bao
Nguyen, Phuoc
Nguyen, Thin
author_facet Tran, Quang-Duy
Duong, Bao
Nguyen, Phuoc
Nguyen, Thin
contents Telling apart the cause and effect between two random variables with purely observational data is a challenging problem that finds applications in various scientific disciplines. A key principle utilized in this task is the algorithmic Markov condition, which postulates that the joint distribution, when factorized according to the causal direction, yields a more succinct codelength compared to the anti-causal direction. Previous approaches approximate these codelengths by relying on simple functions or Gaussian processes (GPs) with easily evaluable complexity, compromising between model fitness and computational complexity. To address these limitations, we propose leveraging the variational Bayesian learning of neural networks as an interpretation of the codelengths. This allows the improvement of model fitness, while maintaining the succinctness of the codelengths, and the avoidance of the significant computational complexity of the GP-based approaches. Extensive experiments on both synthetic and real-world benchmarks in cause-effect identification demonstrate the effectiveness of our proposed method, showing promising performance enhancements on several datasets in comparison to most related methods.
format Preprint
id arxiv_https___arxiv_org_abs_2505_07503
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Identifying Causal Direction via Variational Bayesian Compression
Tran, Quang-Duy
Duong, Bao
Nguyen, Phuoc
Nguyen, Thin
Machine Learning
Telling apart the cause and effect between two random variables with purely observational data is a challenging problem that finds applications in various scientific disciplines. A key principle utilized in this task is the algorithmic Markov condition, which postulates that the joint distribution, when factorized according to the causal direction, yields a more succinct codelength compared to the anti-causal direction. Previous approaches approximate these codelengths by relying on simple functions or Gaussian processes (GPs) with easily evaluable complexity, compromising between model fitness and computational complexity. To address these limitations, we propose leveraging the variational Bayesian learning of neural networks as an interpretation of the codelengths. This allows the improvement of model fitness, while maintaining the succinctness of the codelengths, and the avoidance of the significant computational complexity of the GP-based approaches. Extensive experiments on both synthetic and real-world benchmarks in cause-effect identification demonstrate the effectiveness of our proposed method, showing promising performance enhancements on several datasets in comparison to most related methods.
title Identifying Causal Direction via Variational Bayesian Compression
topic Machine Learning
url https://arxiv.org/abs/2505.07503