MCVCC: Mixture Conditional Variational Causal Clustering

• MCVCC is a causality-aware clustering method that leverages a Hybrid Additive Noise Model and variational autoencoders to differentiate heterogeneous causal mechanisms.
• The approach formulates causal direction selection by comparing forward and reverse likelihoods and then performs k-means clustering on residuals reflecting mechanism-specific noise.
• Empirical results demonstrate high accuracy in causal direction inference and clustering performance, although its bivariate scope and external cluster number limit broader application.

Searching arXiv for MCVCC and closely related causal mixture clustering papers. arXiv search query: "Mixture Conditional Variational Causal Clustering MCVCC" Mixture Conditional Variational Causal Clustering (MCVCC) is a causality-aware clustering method for bivariate observational data with heterogeneous causal mechanisms across environments. In the formulation introduced alongside Mixture Conditional Variational Causal Inference (MCVCI), the data are modeled by a Hybrid Additive Noise Model (HANM), causal direction is selected by comparing forward and backward likelihood surrogates derived from a mixture conditional variational auto-encoder, and clustering is then performed on residuals in the inferred causal direction. The intended target of the clustering is not geometric similarity in raw observation space but “causal mechanism expression,” namely the mechanism-specific offset or noise term associated with each observation (Liu et al., 29 Jul 2025).

1. Conceptual basis and antecedents

MCVCC belongs to a line of work that replaces conventional clustering-by-covariates with clustering-by-mechanism. In the immediate formulation, the observed data consist of two scalar variables $X$ and $Y$, and the motivating assumption is that real-world observations are collected from multiple environments with heterogeneous causal relationships. Rather than assuming one stable additive noise model for all observations, MCVCC assumes that the overall sample is generated by multiple distinct causal mechanisms, each of which contributes to a finite mixture.

This mechanism-centric view has clear antecedents. “Causal Inference and Mechanism Clustering of A Mixture of Additive Noise Models” introduced an ANM mixture model in which observations are generated by a finite mixture of additive noise models sharing a causal direction, and it performed clustering over inferred latent mechanism parameters $\theta_n$ after causal direction selection (Hu et al., 2018). Broader causal-clustering formulations also exist outside the bivariate additive-noise setting. “Causal Structure Discovery from Distributions Arising from Mixtures of DAGs” studies mixtures of DAGs and uses the recovered union graph to identify varying nodes and guide clustering (Saeed et al., 2020), while “CCSL: A Causal Structure Learning Method from Multiple Unknown Environments” jointly clusters subjects and learns cluster-specific linear non-Gaussian SVARs via a Causality-related Chinese Restaurant Process and variational inference (Chen et al., 2021). In a different causal-mixture direction, “Synthetic Potential Outcomes and Causal Mixture Identifiability” defines latent groups by heterogeneity in potential outcomes rather than by similarity in observables, suggesting a distinct but related notion of causal clusters (Mazaheri et al., 2024).

Within this landscape, MCVCC is narrower in scope but more explicit in its workflow: it is a bivariate, HANM-based, variationally trained mechanism-clustering procedure built on a causal direction test and a residual-space clustering step.

2. Hybrid Additive Noise Model and causal identifiability

The formal backbone of MCVCC is the Hybrid Additive Noise Model. Its point of departure is the standard additive noise model

$Y = f(X) + \varepsilon,$

with $\varepsilon \perp\!\!\!\perp X$, together with the reverse-direction hypothesis

$X = g(Y) + \hat{\varepsilon}.$

To model heterogeneous causality, the HANM replaces a single mechanism with a finite mixture: $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$ where $w_k \ge 0$, $\sum_{k=1}^{K} w_k = 1$, $f_k$ is the causal function in component $Y$0, $Y$1 is additive noise in component $Y$2, and $Y$3 (Liu et al., 29 Jul 2025). The mixture components are interpreted as distinct causal mechanisms, regimes, or environments.

The corresponding joint density is written in both directions as

$Y$4

The identifiability argument extends standard ANM asymmetry to the mixture setting. Assuming $Y$5 and a forward HANM, the existence of a reverse HANM implies that $Y$6 must satisfy a restrictive third-order differential equation,

$Y$7

with $Y$8 defined from derivatives of the mixture noise log-densities and the component functions. The stated conclusion is that “It is almost impossible to exist a hybrid ANM satisfying the condition from $Y$9” (Liu et al., 29 Jul 2025). Accordingly, the paper treats HANM as almost identifiable in the correct causal direction.

A recurrent misconception is to treat this identifiability result as a theorem about clustering consistency. The theory supplied for MCVCC is primarily a theory of causal direction identifiability for the hybrid additive-noise model. The paper does not state a formal theorem that the k-means stage of MCVCC is itself identifiable or asymptotically consistent. It only notes that if the latent residual $\theta_n$0 equals, up to transformation, the component-specific noise term $\theta_n$1, and if these component noise distributions are well separated, then k-means on $\theta_n$2 would recover mechanism clusters as sample size grows; this is presented as intuitive justification rather than a proved result (Liu et al., 29 Jul 2025).

3. MCVCI as the generative and scoring backbone

MCVCC inherits its probabilistic machinery from MCVCI. For the direction $\theta_n$3, the model uses a mixture conditional variational auto-encoder with several latent variables and network modules. The latent variables are $\theta_n$4, a conditional latent feature extracted from $\theta_n$5; $\theta_n$6 for $\theta_n$7, the mixture latent variables corresponding to each causal mechanism; and $\theta_n$8, a discrete mixture component indicator with prior $\theta_n$9, $Y = f(X) + \varepsilon,$0. Encoder2 maps $Y = f(X) + \varepsilon,$1 to $Y = f(X) + \varepsilon,$2, an MLP for each $Y = f(X) + \varepsilon,$3 outputs Gaussian parameters $Y = f(X) + \varepsilon,$4 for $Y = f(X) + \varepsilon,$5, Encoder3 outputs mixture weights $Y = f(X) + \varepsilon,$6 through a softmax layer, and the Decoder reconstructs component predictions $Y = f(X) + \varepsilon,$7, aggregated as

$Y = f(X) + \varepsilon,$8

(Liu et al., 29 Jul 2025).

The variational objective is a conditional ELBO for $Y = f(X) + \varepsilon,$9: $\varepsilon \perp\!\!\!\perp X$0 Training maximizes the ELBO, equivalently minimizing $\varepsilon \perp\!\!\!\perp X$1, using Adam (Liu et al., 29 Jul 2025).

MCVCI converts this variational model into a causal decision rule by forming approximate joint log-likelihood scores in each direction. For $\varepsilon \perp\!\!\!\perp X$2,

$\varepsilon \perp\!\!\!\perp X$3

and analogously for $\varepsilon \perp\!\!\!\perp X$4,

$\varepsilon \perp\!\!\!\perp X$5

The decision rule is then purely score-based: infer $\varepsilon \perp\!\!\!\perp X$6 when $\varepsilon \perp\!\!\!\perp X$7, infer $\varepsilon \perp\!\!\!\perp X$8 when the reverse inequality holds, and otherwise remain undecided. The algorithm standardizes the data, splits train and test sets, and first checks the sample correlation $\varepsilon \perp\!\!\!\perp X$9; if $X = g(Y) + \hat{\varepsilon}.$0, it outputs “no causal relation” (Liu et al., 29 Jul 2025). The paper also defines the confidence score

$X = g(Y) + \hat{\varepsilon}.$1

4. Clustering by causal residuals

MCVCC proper begins after causal direction selection. The central design claim is that clustering should operate in a causal feature space derived from the true direction rather than directly in the observed $X = g(Y) + \hat{\varepsilon}.$2 space. The paper states: “We use the $X = g(Y) + \hat{\varepsilon}.$3 term we seek in the true causal direction as the extracted causal feature space and then cluster on it. Here $X = g(Y) + \hat{\varepsilon}.$4 control the shifted values. We regard $X = g(Y) + \hat{\varepsilon}.$5 term as $X = g(Y) + \hat{\varepsilon}.$6 and $X = g(Y) + \hat{\varepsilon}.$7 is the cluster center” (Liu et al., 29 Jul 2025).

Operationally, the causal feature is approximated by a residual. If $X = g(Y) + \hat{\varepsilon}.$8, MCVCC computes

$X = g(Y) + \hat{\varepsilon}.$9

where $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$0 is the MCVCI prediction. If $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$1, it computes

$$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$2

This residual is treated as containing the mixture of noise and mechanism offset, and therefore as a proxy for “causal mechanism expression” (Liu et al., 29 Jul 2025).

Clustering is then formulated as the standard k-means objective

$$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$3

where $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$4 is the center of cluster $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$5. The cluster number $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$6 is assumed given as an input hyperparameter; the paper does not provide a formula for selecting $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$7 automatically (Liu et al., 29 Jul 2025).

The algorithmic sequence is explicit. MCVCC takes as input $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$8, a learning rate $$Y = \sum_{k=1}^{K} w_k \big( f_k(x_k) + \epsilon_k \big),$$9, and the cluster number $w_k \ge 0$0. It standardizes the data, trains MCVCI in the forward direction to obtain $w_k \ge 0$1, computes $w_k \ge 0$2 and $w_k \ge 0$3, trains the reverse model to obtain $w_k \ge 0$4 and $w_k \ge 0$5, chooses the causal direction by comparing the two scores, sets $w_k \ge 0$6 to the corresponding residual, applies k-means with the above objective, and returns clustering labels (Liu et al., 29 Jul 2025).

A useful interpretive point is that MCVCC does not cluster the latent mixture indicators $w_k \ge 0$7 of the mixture CVAE directly. It clusters a residual-space summary derived from the fitted causal model. This makes the method a two-stage hybrid: variational causal modeling first, residual-space k-means second.

5. Relation to adjacent causal-clustering formulations

MCVCC is best understood as one member of a broader family of causal mixture methods, but its particular combination of assumptions is specific. The following comparison isolates the clustering object and the causal structure each method emphasizes.

Method	Clustering object	Causal structure
ANM-MM (Hu et al., 2018)	inferred latent mechanism parameters $w_k \ge 0$8	finite mixture of ANMs with GPPOM and HSIC
Mixtures of DAGs (Saeed et al., 2020)	varying nodes / samples clustered from union-graph information	component DAGs, union MAG, FCI
CCSL (Chen et al., 2021)	subjects sharing the same causal mechanism	cluster-specific linear non-Gaussian SVARs with causal CRP and VI
Synthetic potential outcomes (Mazaheri et al., 2024)	latent groups defined by treatment-effect heterogeneity	mixtures of treatment effects via multi-view moments
MCVCC (Liu et al., 29 Jul 2025)	residual feature $w_k \ge 0$9 approximating $\sum_{k=1}^{K} w_k = 1$0	HANM, mixture CVAE, likelihood comparison, k-means

The nearest precursor is ANM-MM. There, the generative model is

$\sum_{k=1}^{K} w_k = 1$1

with $\sum_{k=1}^{K} w_k = 1$2 taking values in a finite set, and mechanism clustering is performed by fitting a Gaussian Process Partially Observable Model (GPPOM) with an HSIC independence penalty and then running k-means on the inferred latent parameters $\sum_{k=1}^{K} w_k = 1$3 (Hu et al., 2018). Relative to that formulation, MCVCC replaces GP-based latent-parameter estimation and independence-enforced direction selection with a mixture-CVAE likelihood comparison, and it clusters residuals rather than the estimated mechanism parameters themselves.

The other cited lines of work emphasize different causal cluster semantics. Mixtures-of-DAGs methods cluster by varying graph mechanisms and rely on union MAGs and bidirected edges to detect non-invariant nodes (Saeed et al., 2020). CCSL performs joint clustering and causal structure learning for multivariate time series, with the cluster assignment $\sum_{k=1}^{K} w_k = 1$4 representing a subject-level causal mechanism and identifiability following from linear non-Gaussian SVAR theory (Chen et al., 2021). The synthetic-potential-outcome framework defines clusters by the distribution of treatment effects $\sum_{k=1}^{K} w_k = 1$5, not by covariates or raw observational similarity, and shows that mixtures of treatment effects can be identified from multi-view moments without recovering the full latent posterior (Mazaheri et al., 2024). A plausible implication is that “causal clustering” is not a single methodology but a family of formulations in which the clustering object may be a mechanism parameter, a graph regime, a subject-specific SCM, or a treatment-effect component.

6. Empirical profile, scope, and limitations

The empirical evaluation reported for the MCVCC line separates causal direction performance from mechanism clustering performance. For MCVCI, the reported causal direction accuracies are $\sum_{k=1}^{K} w_k = 1$6 on SIM, $\sum_{k=1}^{K} w_k = 1$7 on SIM-G, $\sum_{k=1}^{K} w_k = 1$8 on SIM-ln, and $\sum_{k=1}^{K} w_k = 1$9 on CEP, exceeding the listed baselines on those benchmarks (Liu et al., 29 Jul 2025). The paper also reports a confidence-based analysis using $f_k$0, stating that for most datasets the top $f_k$1 of decisions ranked by confidence are all correct.

For MCVCC, synthetic clustering results are reported in terms of ARI and NMI. In a $f_k$2 setting, the method achieves ARI$f_k$3, NMI$f_k$4 for $f_k$5; ARI$f_k$6, NMI$f_k$7 for $f_k$8; ARI$f_k$9, NMI$Y$00 for $Y$01; ARI$Y$02, NMI$Y$03 for $Y$04; and ARI$Y$05, NMI$Y$06 for $Y$07 (Liu et al., 29 Jul 2025). Under varying noise and cluster counts, the reported values include ARI$Y$08, NMI$Y$09 for a $Y$10 case, ARI$Y$11, NMI$Y$12 for $Y$13, and ARI$Y$14, NMI$Y$15 for $Y$16. On the BAFU air dataset, where the task is to recover location-based regimes from ozone and temperature, the reported result is ARI$Y$17, NMI$Y$18, substantially above the listed baselines (Liu et al., 29 Jul 2025).

The reported strengths follow directly from this construction. MCVCC is causality-aware because it clusters residuals in the inferred causal direction rather than arbitrary embeddings. It is explicitly designed for heterogeneous mechanisms because the underlying MCVCI model is a mixture conditional VAE aligned with a hybrid additive-noise model. It also inherits the expressive flexibility of neural conditional decoders and Gaussian-mixture latents.

Its limitations are equally explicit. The method is bivariate only; extending it to higher dimensions is named as future work. The cluster number $Y$19 must be supplied externally, and the paper gives no automatic model-selection criterion for $Y$20. Computational cost is higher than in simple regression-based causal methods because both forward and reverse mixture-CVAE models must be trained. Performance may depend on the mixture number $Y$21, architecture, and training details, and the authors note that improving the causal part could “reduce the sensitivity to the mixture numbers” (Liu et al., 29 Jul 2025). Finally, MCVCC depends on correct direction selection by MCVCI; if the direction is misidentified, the residual feature $Y$22 is liable to cease being a useful proxy for mechanism heterogeneity.

These limitations also delimit what MCVCC is not. It is not a general multivariate causal graph learner, not a nonparametric estimator of the number of mechanism clusters, and not a method with a stated clustering-consistency theorem. Within its intended setting—bivariate observational data plausibly generated by a finite mixture of additive-noise mechanisms—it is a specific procedure for revealing heterogeneous causal mechanism expression by combining variational causal scoring with residual-space clustering (Liu et al., 29 Jul 2025).