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 mean and 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.
Figures & tables
Figure 1. Local protein regulatory network example represented by (a) Moment-agnostic causal graph and (b) mean and variance causal graphs (shown in red and blue edges)
Figure 2. Mean and variance causal graph inference performance on synthetic and SERGIO datasets with sample size n=500 . Achieving both lower SHD rate (left) and higher F1 score (right) is better.
Figure 3. Mean and variance causal graph inference performance on synthetic datasets ( n=500 ) under dense graphs
d=2
d=3
d=4
TV
KL
TV
KL
TV
KL
MC3
0.01±0.00
0.01±0.00
0.10±0.01
0.09±0.01
0.42±0.10
6.52±0.91
DDS
0.31±0.10
1.94±0.28
0.32±0.08
1.81±0.21
0.45±0.11
5.52±0.73
Proposed
0.26±0.06
1.01±0.46
0.21±0.09
0.34±0.09
0.34±0.08
1.51±0.28
Table 1. Total variation (TV) distance and KL divergence (KL) of posteriors inferred from linear Gaussian ANM datasets ( n=500 ). Achieving both lower TV and KL values is better.
Figure 4. Moment-agnostic causal graph inference performance on non-Gaussian synthetic datasets ( n=500 ) with (a) Laplace noise and (b) student-t noise. Achieving both lower SHD (left) and lower SID (right) is better.
n=100
n=200
n=853
SHD ( ↓ )
F1 ( ↑ )
SHD ( ↓ )
F1 ( ↑ )
SHD ( ↓ )
F1 ( ↑ )
MC3
22.6 ± 1.1
0.19 ± 0.04
20.3 ± 1.3
0.20 ± 0.07
18.9 ± 0.7
0.14 ± 0.05
DDS
17.6 ± 0.7
0.20 ± 0.03
16.6 ± 0.6
0.20 ± 0.02
15.0 ± 0.7
0.28 ± 0.02
ICDH
20.0 ± 1.0
0.21 ± 0.01
17.5 ± 0.5
0.22 ± 0.01
14.5 ± 0.5
0.27 ± 0.03
HOST
16.1 ± 0.5
0.19 ± 0.01
15.0 ± 0.3
0.33 ± 0.02
13.5 ± 0.8
0.38 ± 0.03
Proposed
16.0 ± 0.3
0.20 ± 0.02
14.9 ± 0.4
0.31 ± 0.02
13.7 ± 0.5
0.36 ± 0.02
Table 2. Moment-agnostic graph inference performance on Sachs dataset. ↓ and ↑ denote "lower is better" and "higher is better".
Run time [sec]
DDS
367 ± 11
Proposed
733 ± 19
Proposed +25%
852 ± 38
Proposed +50%
1260 ± 51
Table 3. Run time on Sachs dataset ( n=853 ). Our Proposed needs about twice the run time of DDS due to two-graph inference and can use prior knowledge with small overhead.
n=100
n=200
n=853
Proposed
0.585±0.009
0.592±0.008
0.620±0.019
Table 4. Estimated posterior probability of MEK → ERK in inferred variance causal graph structure
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Method
Mean ( d=5 )
Variance ( d=5 )
Mean ( d=10 )
Variance ( d=10 )
Proposed
2.34±0.20
3.33±0.30
15.5±1.2
19.3±1.1
ICDH
5.05±0.42
4.55±0.40
20.1±1.1
20.9±1.2
HOST
4.84±0.49
4.60±0.45
19.6±1.8
21.6±1.4
VarSort
5.00±1.00
6.00±1.66
18.5±6.2
21.9±4.4
Appendix
Table 5. SHD score comparison with VarSort on mean-variance HNM datasets ( n=500 ) with number of nodes d=5,10
Figure 5. Moment-agnostic causal graph inference performance on nonlinear Gaussian ANM datasets ( n=500 ) with number of nodes d=5,10,20,50 : ↓ and ↑ denote "lower is better" and "higher is better".
Figure 6. Moment-agnostic causal graph inference performance on nonlinear Gaussian HNM datasets ( n=500 ) with number of nodes d=5,10,20,50 : ↓ and ↑ denote "lower is better" and "higher is better".
Massachusetts Institute of Technology · This work was conducted while the author was a PhD student at Purdue University, independently of the author’s dissertation research.