Moment Matters: Mean and Variance Causal Graph Discovery from Heteroscedastic Observational Data

• URL: http://arxiv.org/abs/2602.23602v1
• Date: Fri, 27 Feb 2026 02:13:03 GMT
• Title: Moment Matters: Mean and Variance Causal Graph Discovery from Heteroscedastic Observational Data
• Authors: Yoichi Chikahara,
• Abstract summary: Heteroscedasticity -- where the variance of a variable changes with other variables -- is pervasive in real data.<n>Standard causal discovery does not reveal which causes act on the mean versus the variance, as it returns a single moment-agnostic graph.<n>We propose a Bayesian, moment-driven causal discovery framework that infers separate textitmean and textit variance causal graphs from observational heteroscedastic data.
• Score: 2.436681150766912
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Heteroscedasticity -- where the variance of a variable changes with other variables -- is pervasive in real data, and elucidating why it arises from the perspective of statistical moments is crucial in scientific knowledge discovery and decision-making. However, standard causal discovery does not reveal which causes act on the mean versus the variance, as it returns a single moment-agnostic graph, limiting interpretability and downstream intervention design. We propose a Bayesian, moment-driven causal discovery framework that infers separate \textit{mean} and \textit{variance} causal graphs from observational heteroscedastic data. We first derive the identification results by establishing sufficient conditions under which these two graphs are separately identifiable. Building on this theory, we develop a variational inference method that learns a posterior distribution over both graphs, enabling principled uncertainty quantification of structural features (e.g., edges, paths, and subgraphs). To address the challenges of parameter optimization in heteroscedastic models with two graph structures, we take a curvature-aware optimization approach and develop a prior incorporation technique that leverages domain knowledge on node orderings, improving sample efficiency. Experiments on synthetic, semi-synthetic, and real data show that our approach accurately recovers mean and variance structures and outperforms state-of-the-art baselines.

Related papers

• Causal Graph Learning via Distributional Invariance of Cause-Effect Relationship [54.575090553659074]
  We develop an algorithm that efficiently uncovers causal relationships with quadratic complexity in the number of observational variables.<n>Our experiments on a varied benchmark of large-scale datasets show superior or equivalent performance compared to existing works.
  arXiv  Detail & Related papers  (2026-02-03T10:26:16Z)
• Effects of Distributional Biases on Gradient-Based Causal Discovery in the Bivariate Categorical Case [0.4339839287869652]
  We show that gradient-based causal discovery can be susceptible to distributional biases in the data they are trained on.<n>We employ two simple models that derive causal factorizations by learning marginal or conditional data distributions.<n>An empirical evaluation of two related approaches indicates that eliminating competition between possible causal factorizations can make models robust to the presented biases.
  arXiv  Detail & Related papers  (2025-09-01T17:08:03Z)
• diffIRM: A Diffusion-Augmented Invariant Risk Minimization Framework for Spatiotemporal Prediction over Graphs [6.677219861416146]
  Intemporal prediction over graphs (GSTP) is challenging, because real-world data suffers from the Out-of-Distribution (OOD) problem.<n>In this study, we propose a diffusion-augmented invariant risk minimization (diffIRM) framework that combines these two principles.
  arXiv  Detail & Related papers  (2024-12-31T06:45:47Z)
• Causal Discovery on Dependent Binary Data [6.464898093190062]
  We propose a decorrelation-based approach for causal graph learning on dependent binary data.<n>We develop an EM-like iterative algorithm to generate and decorrelate samples of the latent utility variables.<n>We demonstrate that the proposed decorrelation approach significantly improves the accuracy in causal graph learning.
  arXiv  Detail & Related papers  (2024-12-28T21:55:42Z)
• Towards Causal Representation Learning and Deconfounding from Indefinite Data [17.793702165499298]
  Non-statistical data (e.g., images, text, etc.) encounters significant conflicts in terms of properties and methods with traditional causal data. We redefine causal data from two novel perspectives and then propose three data paradigms. We implement the above designs as a dynamic variational inference model, tailored to learn causal representation from indefinite data.
  arXiv  Detail & Related papers  (2023-05-04T08:20:37Z)
• On the Strong Correlation Between Model Invariance and Generalization [54.812786542023325]
  Generalization captures a model's ability to classify unseen data. Invariance measures consistency of model predictions on transformations of the data. From a dataset-centric view, we find a certain model's accuracy and invariance linearly correlated on different test sets.
  arXiv  Detail & Related papers  (2022-07-14T17:08:25Z)
• Invariance Principle Meets Out-of-Distribution Generalization on Graphs [66.04137805277632]
  Complex nature of graphs thwarts the adoption of the invariance principle for OOD generalization. domain or environment partitions, which are often required by OOD methods, can be expensive to obtain for graphs. We propose a novel framework to explicitly model this process using a contrastive strategy.
  arXiv  Detail & Related papers  (2022-02-11T04:38:39Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Variational Causal Networks: Approximate Bayesian Inference over Causal Structures [132.74509389517203]
  We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs. In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
  arXiv  Detail & Related papers  (2021-06-14T17:52:49Z)
• A Meta Learning Approach to Discerning Causal Graph Structure [1.52292571922932]
  We explore the usage of meta-learning to derive the causal direction between variables by optimizing over a measure of distribution simplicity. We incorporate a graph representation which includes latent variables and allows for more generalizability and graph structure expression. Our model is able to learn causal direction indicators for complex graph structures despite effects of latent confounders.
  arXiv  Detail & Related papers  (2021-06-06T22:44:44Z)

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.