Fast Flow Matching based Conditional Independence Tests for Causal Discovery

• URL: http://arxiv.org/abs/2602.08315v1
• Date: Mon, 09 Feb 2026 06:43:23 GMT
• Title: Fast Flow Matching based Conditional Independence Tests for Causal Discovery
• Authors: Shunyu Zhao, Yanfeng Yang, Shuai Li, Kenji Fukumizu,
• Abstract summary: Constraint-based causal discovery methods require a large number of conditional independence (CI) tests.<n>We propose the Flow Matching-based Conditional Independence Test (FMCIT)<n>The proposed test leverages the high computational efficiency of flow matching and requires the model to be trained only once throughout the entire causal discovery procedure.
• Score: 19.33167245211968
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Constraint-based causal discovery methods require a large number of conditional independence (CI) tests, which severely limits their practical applicability due to high computational complexity. Therefore, it is crucial to design an algorithm that accelerates each individual test. To this end, we propose the Flow Matching-based Conditional Independence Test (FMCIT). The proposed test leverages the high computational efficiency of flow matching and requires the model to be trained only once throughout the entire causal discovery procedure, substantially accelerating causal discovery. According to numerical experiments, FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis, even in the presence of high-dimensional conditioning sets. In addition, we further integrate FMCIT into a two-stage guided PC skeleton learning framework, termed GPC-FMCIT, which combines fast screening with guided, budgeted refinement using FMCIT. This design yields explicit bounds on the number of CI queries while maintaining high statistical power. Experiments on synthetic and real-world causal discovery tasks demonstrate favorable accuracy-efficiency trade-offs over existing CI testing methods and PC variants.

Related papers

• Causal Discovery for Cross-Sectional Data Based on Super-Structure and Divide-and-Conquer [9.740161937852067]
  We propose a novel framework that relaxes the strict requirements on Super-Structure construction while preserving the algorithmic benefits of divide-and-conquer.<n>We instantiate the framework in a concrete causal discovery algorithm and rigorously evaluate its components on synthetic data.<n>Our results establish that accurate, scalable causal discovery is achievable even under minimal assumptions about the initial Super-Structure.
  arXiv  Detail & Related papers  (2026-02-03T16:18:17Z)
• Efficient Ensemble Conditional Independence Test Framework for Causal Discovery [46.328102756312724]
  We introduce the Ensemble Conditional Independence Test (E-CIT), a general and plug-and-play framework.<n>E-CIT partitions the data into subsets, applies a given base CIT independently to each subset, and aggregates the resulting p-values.<n>Results demonstrate that E-CIT not only significantly reduces the computational burden of CITs and causal discovery but also achieves competitive performance.
  arXiv  Detail & Related papers  (2025-09-25T11:31:16Z)
• A Sample Efficient Conditional Independence Test in the Presence of Discretization [54.047334792855345]
  Conditional Independence (CI) tests directly to discretized data can lead to incorrect conclusions.<n>Recent advancements have sought to infer the correct CI relationship between the latent variables through binarizing observed data.<n>Motivated by this, this paper introduces a sample-efficient CI test that does not rely on the binarization process.
  arXiv  Detail & Related papers  (2025-06-10T12:41:26Z)
• Score-based Generative Modeling for Conditional Independence Testing [35.0533359302886]
  We propose a novel CI testing method via score-based generative modeling, which achieves precise Type I error control and strong testing power.<n>We theoretically establish the error bound of conditional distributions modeled by score-based generative models and prove the validity of our CI tests.
  arXiv  Detail & Related papers  (2025-05-29T10:10:46Z)
• A Fast Kernel-based Conditional Independence test with Application to Causal Discovery [9.416064439922001]
  FastKCI is a scalable and parallelizable kernel-based conditional independence test.<n>Experiments on synthetic datasets and benchmarks on real-world production data validate that FastKCI maintains the statistical power of the original KCI test.
  arXiv  Detail & Related papers  (2025-05-16T10:14:57Z)
• Testing Causal Models with Hidden Variables in Polynomial Delay via Conditional Independencies [49.99600569996907]
  Testing a hypothesized causal model against observational data is a key prerequisite for many causal inference tasks.<n>While a model can assume exponentially many conditional independence relations (CIs), testing all of them is both impractical and unnecessary.<n>We introduce c-LMP for causal graphs with hidden variables and develop a delay algorithm to list these CIs in poly-time intervals.
  arXiv  Detail & Related papers  (2024-09-22T21:05:56Z)
• Precise Error Rates for Computationally Efficient Testing [67.30044609837749]
  We revisit the question of simple-versus-simple hypothesis testing with an eye towards computational complexity.<n>An existing test based on linear spectral statistics achieves the best possible tradeoff curve between type I and type II error rates.
  arXiv  Detail & Related papers  (2023-11-01T04:41:16Z)
• On sample complexity of conditional independence testing with Von Mises estimator with application to causal discovery [21.12645737093305]
  conditional independence testing is an essential step in constraint-based causal discovery algorithms. We design a test for conditional independence based on our estimator, called VM-CI, which achieves optimal parametric rates. We empirically show that VM-CI outperforms other popular CI tests in terms of either time or sample complexity.
  arXiv  Detail & Related papers  (2023-10-20T14:52:25Z)
• Validation Diagnostics for SBI algorithms based on Normalizing Flows [55.41644538483948]
  This work proposes easy to interpret validation diagnostics for multi-dimensional conditional (posterior) density estimators based on NF. It also offers theoretical guarantees based on results of local consistency. This work should help the design of better specified models or drive the development of novel SBI-algorithms.
  arXiv  Detail & Related papers  (2022-11-17T15:48:06Z)
• Improving the Efficiency of the PC Algorithm by Using Model-Based Conditional Independence Tests [11.33674514817655]
  Constraint-based structure learning algorithms such as PC use conditional independence (CI) tests to infer causal structure. Traditionally, constraint-based algorithms perform CI tests with a preference for smaller-sized conditioning sets. We propose a new strategy for constraint-based algorithms which may result in a reduction of the total number of CI tests performed.
  arXiv  Detail & Related papers  (2022-11-12T00:54:53Z)
• SUOD: Accelerating Large-Scale Unsupervised Heterogeneous Outlier Detection [63.253850875265115]
  Outlier detection (OD) is a key machine learning (ML) task for identifying abnormal objects from general samples. We propose a modular acceleration system, called SUOD, to address it.
  arXiv  Detail & Related papers  (2020-03-11T00:22:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.