DOAJ Open Access 2019

Approximate Kernel-Based Conditional Independence Tests for Fast Non-Parametric Causal Discovery

Strobl Eric V. Zhang Kun Visweswaran Shyam

Abstrak

Constraint-based causal discovery (CCD) algorithms require fast and accurate conditional independence (CI) testing. The Kernel Conditional Independence Test (KCIT) is currently one of the most popular CI tests in the non-parametric setting, but many investigators cannot use KCIT with large datasets because the test scales at least quadratically with sample size. We therefore devise two relaxations called the Randomized Conditional Independence Test (RCIT) and the Randomized conditional Correlation Test (RCoT) which both approximate KCIT by utilizing random Fourier features. In practice, both of the proposed tests scale linearly with sample size and return accurate p-values much faster than KCIT in the large sample size context. CCD algorithms run with RCIT or RCoT also return graphs at least as accurate as the same algorithms run with KCIT but with large reductions in run time.

Penulis (3)

S

Strobl Eric V.

Z

Zhang Kun

V

Visweswaran Shyam

Format Sitasi

V., S.E., Kun, Z., Shyam, V. (2019). Approximate Kernel-Based Conditional Independence Tests for Fast Non-Parametric Causal Discovery. https://doi.org/10.1515/jci-2018-0017

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →
Lihat di Sumber doi.org/10.1515/jci-2018-0017
Informasi Jurnal
Tahun Terbit
2019
Sumber Database
DOAJ
DOI
10.1515/jci-2018-0017
Akses
Open Access ✓