Conditional Independence Testing via Latent Representation Learning

• URL: http://arxiv.org/abs/2209.01547v1
• Date: Sun, 4 Sep 2022 07:16:03 GMT
• Title: Conditional Independence Testing via Latent Representation Learning
• Authors: Bao Duong and Thin Nguyen
• Abstract summary: LCIT (Latent representation based Conditional Independence Test) is a novel non-parametric method for conditional independence testing based on representation learning. Our main contribution involves proposing a generative framework in which to test for the independence between X and Y given Z.
• Score: 2.566492438263125
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Detecting conditional independencies plays a key role in several statistical and machine learning tasks, especially in causal discovery algorithms. In this study, we introduce LCIT (Latent representation based Conditional Independence Test)-a novel non-parametric method for conditional independence testing based on representation learning. Our main contribution involves proposing a generative framework in which to test for the independence between X and Y given Z, we first learn to infer the latent representations of target variables X and Y that contain no information about the conditioning variable Z. The latent variables are then investigated for any significant remaining dependencies, which can be performed using the conventional partial correlation test. The empirical evaluations show that LCIT outperforms several state-of-the-art baselines consistently under different evaluation metrics, and is able to adapt really well to both non-linear and high-dimensional settings on a diverse collection of synthetic and real data sets.

Related papers

• On Discovery of Local Independence over Continuous Variables via Neural Contextual Decomposition [26.34622544479565]
  We define and characterize the local independence relationship that holds in a specific set of joint assignments of parental variables. We propose a novel method, coined neural contextual decomposition (NCD), which learns such partition by imposing each set to induce CSSI.
  arXiv  Detail & Related papers  (2024-05-12T08:48:37Z)
• Revisiting the Evaluation of Image Synthesis with GANs [55.72247435112475]
  This study presents an empirical investigation into the evaluation of synthesis performance, with generative adversarial networks (GANs) as a representative of generative models. In particular, we make in-depth analyses of various factors, including how to represent a data point in the representation space, how to calculate a fair distance using selected samples, and how many instances to use from each set.
  arXiv  Detail & Related papers  (2023-04-04T17:54:32Z)
• Model-Free Sequential Testing for Conditional Independence via Testing by Betting [8.293345261434943]
  The proposed test allows researchers to analyze an incoming i.i.d. data stream with any arbitrary dependency structure. We allow the processing of data points online as soon as they arrive and stop data acquisition once significant results are detected.
  arXiv  Detail & Related papers  (2022-10-01T20:05:33Z)
• Non-Parametric Inference of Relational Dependence [17.76905154531867]
  This work examines the problem of estimating independence in data drawn from relational systems. We propose a consistent, non-parametric, scalable kernel test to operationalize the relational independence test for non-i.i.d. observational data.
  arXiv  Detail & Related papers  (2022-06-30T03:42:20Z)
• Equivariance Allows Handling Multiple Nuisance Variables When Analyzing Pooled Neuroimaging Datasets [53.34152466646884]
  In this paper, we show how bringing recent results on equivariant representation learning instantiated on structured spaces together with simple use of classical results on causal inference provides an effective practical solution. We demonstrate how our model allows dealing with more than one nuisance variable under some assumptions and can enable analysis of pooled scientific datasets in scenarios that would otherwise entail removing a large portion of the samples.
  arXiv  Detail & Related papers  (2022-03-29T04:54:06Z)
• Nonparametric Conditional Local Independence Testing [69.31200003384122]
  Conditional local independence is an independence relation among continuous time processes. No nonparametric test of conditional local independence has been available. We propose such a nonparametric test based on double machine learning.
  arXiv  Detail & Related papers  (2022-03-25T10:31:02Z)
• Learning Conditional Invariance through Cycle Consistency [60.85059977904014]
  We propose a novel approach to identify meaningful and independent factors of variation in a dataset. Our method involves two separate latent subspaces for the target property and the remaining input information. We demonstrate on synthetic and molecular data that our approach identifies more meaningful factors which lead to sparser and more interpretable models.
  arXiv  Detail & Related papers  (2021-11-25T17:33:12Z)
• Data-Driven Representations for Testing Independence: Modeling, Analysis and Connection with Mutual Information Estimation [3.9023554886892433]
  This work addresses testing the independence of two continuous and finite-dimensional random variables from the design of a data-driven partition. It is shown that approximating the sufficient statistics of an oracle test offers a learning criterion for designing a data-driven partition. Some experimental analyses provide evidence regarding our scheme's advantage for testing independence compared with some strategies that do not use data-driven representations.
  arXiv  Detail & Related papers  (2021-10-27T02:06:05Z)
• Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style [32.20957709045773]
  We formulate the augmentation process as a latent variable model. We study the identifiability of the latent representation based on pairs of views of the observations. We introduce Causal3DIdent, a dataset of high-dimensional, visually complex images with rich causal dependencies.
  arXiv  Detail & Related papers  (2021-06-08T18:18:09Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Causal Feature Selection for Algorithmic Fairness [61.767399505764736]
  We consider fairness in the integration component of data management. We propose an approach to identify a sub-collection of features that ensure the fairness of the dataset.
  arXiv  Detail & Related papers  (2020-06-10T20:20:10Z)

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.