Causal discovery for linear causal model with correlated noise: an Adversarial Learning Approach

• URL: http://arxiv.org/abs/2601.01368v1
• Date: Sun, 04 Jan 2026 04:40:04 GMT
• Title: Causal discovery for linear causal model with correlated noise: an Adversarial Learning Approach
• Authors: Mujin Zhou, Junzhe Zhang,
• Abstract summary: This paper proposes an approach based on the f-GAN framework, learning the binary causal structure independent of specific weight values.<n>We prove that this problem is equivalent to minimizing the f-divergence between the true data distribution and the model-generated distribution.
• Score: 5.276544734565369
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Causal discovery from data with unmeasured confounding factors is a challenging problem. This paper proposes an approach based on the f-GAN framework, learning the binary causal structure independent of specific weight values. We reformulate the structure learning problem as minimizing Bayesian free energy and prove that this problem is equivalent to minimizing the f-divergence between the true data distribution and the model-generated distribution. Using the f-GAN framework, we transform this objective into a min-max adversarial optimization problem. We implement the gradient search in the discrete graph space using Gumbel-Softmax relaxation.

Related papers

• On the Wasserstein Convergence and Straightness of Rectified Flow [54.580605276017096]
  Rectified Flow (RF) is a generative model that aims to learn straight flow trajectories from noise to data.<n>We provide a theoretical analysis of the Wasserstein distance between the sampling distribution of RF and the target distribution.<n>We present general conditions guaranteeing uniqueness and straightness of 1-RF, which is in line with previous empirical findings.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Optimal Transport for Structure Learning Under Missing Data [31.240965564055138]
  We propose a score-based algorithm for learning causal structures from missing data based on optimal transport. Our framework is shown to recover the true causal structure more effectively than competing methods in most simulations and real-data settings.
  arXiv  Detail & Related papers  (2024-02-23T10:49:04Z)
• Learning Causal Graphs via Monotone Triangular Transport Maps [1.6752182911522522]
  We study the problem of causal structure learning from data using optimal transport (OT) We provide an algorithm for causal discovery up to Markov Equivalence with no assumptions on the structural equations/noise distributions. We provide experimental results to compare the proposed approach with the state of the art on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2023-05-26T13:24:17Z)
• Smoothly Giving up: Robustness for Simple Models [30.56684535186692]
  Examples of algorithms to train such models include logistic regression and boosting. We use $Served-Served joint convex loss functions, which tunes between canonical convex loss functions, to robustly train such models. We also provide results for boosting a COVID-19 dataset for logistic regression, highlighting the efficacy approach across multiple relevant domains.
  arXiv  Detail & Related papers  (2023-02-17T19:48:11Z)
• Learning Latent Structural Causal Models [31.686049664958457]
  In machine learning tasks, one often operates on low-level data like image pixels or high-dimensional vectors. We present a tractable approximate inference method which performs joint inference over the causal variables, structure and parameters of the latent Structural Causal Model.
  arXiv  Detail & Related papers  (2022-10-24T20:09:44Z)
• Score matching enables causal discovery of nonlinear additive noise models [63.93669924730725]
  We show how to design a new generation of scalable causal discovery methods. We propose a new efficient method for approximating the score's Jacobian, enabling to recover the causal graph.
  arXiv  Detail & Related papers  (2022-03-08T21:34:46Z)
• A Fast Non-parametric Approach for Causal Structure Learning in Polytrees [0.0]
  We develop DAG-FOCI, a fast algorithm for causal structure learning with no assumptions on the functional relationships and noise. We demonstrate the applicability of DAG-FOCI on real data from computational biology citesachs2005causal and illustrate the robustness of our methods to violations of assumptions.
  arXiv  Detail & Related papers  (2021-11-29T21:26:48Z)
• Estimation of Bivariate Structural Causal Models by Variational Gaussian Process Regression Under Likelihoods Parametrised by Normalising Flows [74.85071867225533]
  Causal mechanisms can be described by structural causal models. One major drawback of state-of-the-art artificial intelligence is its lack of explainability.
  arXiv  Detail & Related papers  (2021-09-06T14:52:58Z)
• 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)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)
• Sparsely constrained neural networks for model discovery of PDEs [0.0]
  We present a modular framework that determines the sparsity pattern of a deep-learning based surrogate using any sparse regression technique. We show how a different network architecture and sparsity estimator improve model discovery accuracy and convergence on several benchmark examples.
  arXiv  Detail & Related papers  (2020-11-09T11:02:40Z)
• Belief Propagation Reloaded: Learning BP-Layers for Labeling Problems [83.98774574197613]
  We take one of the simplest inference methods, a truncated max-product Belief propagation, and add what is necessary to make it a proper component of a deep learning model. This BP-Layer can be used as the final or an intermediate block in convolutional neural networks (CNNs) The model is applicable to a range of dense prediction problems, is well-trainable and provides parameter-efficient and robust solutions in stereo, optical flow and semantic segmentation.
  arXiv  Detail & Related papers  (2020-03-13T13:11:35Z)

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.