Latent MMHC: Hybrid Copula Bayesian Networks

• Latent MMHC is a hybrid Bayesian-network learner that applies a latent Gaussian copula to mixed data to produce a unique directed acyclic graph.
• It employs a two-stage process, starting with constraint-based skeleton discovery via latent-PC followed by a score-based hill-climbing search.
• Empirical results show that the SEM-based variant achieves superior structural recovery and balanced sensitivity and specificity despite higher computational costs.

Searching arXiv for papers on latent MMHC and MMHC to ground the article in published work. Latent Max-Min Hill-Climbing (latent MMHC) is a hybrid Bayesian-network structure learner for heterogeneous data that couples a latent Gaussian copula with a constraint-based skeleton phase and a constrained score-based refinement, with the explicit aim of returning a single directed acyclic graph (DAG) rather than a Markov equivalence class or a CPDAG (Iannario et al., 26 Sep 2025). It is introduced for mixed settings in which ordinal questionnaire scores, categorical background variables, and continuous indicators coexist, and it extends the hybrid logic of standard Max-Min Hill-Climbing (MMHC), which in the discrete/Gaussian Bayesian-network literature combines a constraint-based neighborhood search with a score-based hill-climbing orientation phase (Gasse et al., 2015). In that sense, latent MMHC preserves the classical hybrid compromise between conditional-independence discovery and score-guided DAG selection, while transplanting it into a latent-copula framework suitable for mixed-type variables (Iannario et al., 26 Sep 2025).

1. Historical placement within hybrid Bayesian-network learning

Hybrid Bayesian-network learners are characterized by a two-stage workflow: a first stage learns a skeleton or super-structure by constraint-based means, and a second stage performs search-and-score optimization under that structural restriction. Standard MMHC is the canonical instance of this paradigm in the earlier Bayesian-network literature. It uses Max-Min Parents and Children (MMPC) to identify candidate neighbors and then runs a greedy hill-climbing search over DAGs constrained by those candidate parent/child sets. In the 2015 comparison literature, MMHC is described as “the most powerful state-of-the-art algorithm for Bayesian network structure learning,” praised for being fast and accurate in structural reconstruction, effective for large networks, and capable of scaling to thousands of nodes in reasonable time, albeit as a local-optimum heuristic rather than an exact search procedure (Gasse et al., 2015).

Later hybrid work sharpened the same template by changing only the constraint-based front end. H2PC, for example, keeps the same score-based stage as MMHC but replaces MMPC with a more recall-oriented local-neighborhood learner in order to compensate for false negatives in the learned skeleton (Gasse et al., 2015). That comparison matters for latent MMHC because the 2025 mixed-data method is framed not as a rejection of MMHC’s hybrid principle, but as its migration into a latent Gaussian copula regime. The central motivation is that existing latent-copula learners are typically constraint-based only, so they recover a CPDAG rather than a single oriented DAG, which is less satisfactory when downstream reasoning, scenario analysis, or decision support requires a fully directed and interpretable network (Iannario et al., 26 Sep 2025).

2. Latent Gaussian copula formulation

The distributional engine of latent MMHC is a latent Gaussian copula. Each observed mixed-type variable $X_j$ is associated with an unobserved standard normal latent variable $Z_j$ through

$Z_j = \Phi^{-1}(F_j(X_j)),$

where $F_j$ is the marginal CDF of $X_j$ and $\Phi^{-1}$ is the standard normal quantile function. The latent vector is modeled as

$\mathbf Z \sim \mathcal N_p(0,\Sigma),$

with $\Sigma$ a correlation matrix encoding dependence relations (Iannario et al., 26 Sep 2025).

This formulation permits arbitrary marginal distributions while relocating structural learning to latent space. Continuous variables are treated as monotone transformations of the latent Gaussian; ordinal and binary variables are treated as discretizations of the latent Gaussian; categorical variables are handled in the same mixed-copula spirit through their ordinal/discrete marginals. Conditional independences are then assessed via partial correlations computed from $\Sigma$. In the Gaussian or latent-Gaussian setting, the paper states that conditional independence is linked to vanishing partial correlation,

$$X_i \perp\!\!\!\perp X_j \mid \mathbf X_S \quad \Longleftrightarrow \quad \rho_{ij\cdot S}=0.$$

For continuous variables, latent and observed conditional independences coincide under the nonparanormal/coplanar assumptions. With discrete margins, the paper notes that additional dependencies can appear, but treats these as secondary to the latent correlation structure (Iannario et al., 26 Sep 2025).

The significance of this modeling move is methodological rather than merely notational. Standard Bayesian-network learners often require either discrete parameterizations or ad hoc preprocessing. Latent MMHC instead performs structure learning without ad hoc discretization during the learning stage, using rank-based dependence estimation within a mixed-type copula construction (Iannario et al., 26 Sep 2025).

3. Two-stage algorithmic pipeline

The first phase of latent MMHC is constraint-based skeleton discovery via latent-PC. The latent correlation matrix is estimated from pairwise Kendall’s $Z_j$0, and conditional-independence testing is conducted through partial correlations derived from that latent correlation matrix. As in standard PC, the procedure starts from a complete graph, removes edges when conditional independence is detected for some conditioning set, and then orients colliders and propagates orientations under the usual rules. In latent MMHC, however, this output is not the final graph: it serves as a restriction set for a second-stage score-based search (Iannario et al., 26 Sep 2025).

The second phase is the component that converts the method into a single-DAG learner. A blacklist is constructed so that edges absent from the estimated skeleton are forbidden, and tabu search is then run over DAGs consistent with that blacklist using bnlearn’s search machinery. Because the score search chooses one oriented graph among admissible candidates, the output is a unique DAG rather than an equivalence class (Iannario et al., 26 Sep 2025).

This architecture mirrors the core logic of standard MMHC. In the earlier formulation, the score-based phase starts from an empty graph, considers add-edge, delete-edge, and reverse-edge moves, and restricts candidate additions according to the learned parent/child neighborhoods. H2PC was explicitly designed so that its second stage is identical to MMHC’s, which made it possible to isolate the effect of improving the skeleton learner (Gasse et al., 2015, Gasse et al., 2015). Latent MMHC retains that same hybrid division of labor—constraint-based pruning followed by restricted score-based orientation—but replaces the discrete/Gaussian MMPC-style front end with latent-PC and uses mixed-data scoring choices adapted to the copula setting (Iannario et al., 26 Sep 2025).

4. Score variants and bootstrap stabilization

The paper defines two score-based refinements. In latent MMHC (SEM), each node is modeled by a linear structural equation on its parents,

$Z_j$1

with mutually independent residuals. The log-likelihood decomposes nodewise as

$Z_j$2

or equivalently

$Z_j$3

where $Z_j$4 is the coefficient of determination from regressing $Z_j$5 on its parents (Iannario et al., 26 Sep 2025).

The alternative latent MMHC (Gauss) uses a Gaussian log-likelihood approximation based on the latent correlation matrix and the decomposition

$Z_j$6

with $Z_j$7 a unit-diagonal lower-triangular matrix encoding the DAG and $Z_j$8. Under this parametrization,

$Z_j$9

Both score variants are used after the same latent-PC restriction step, and both produce a unique DAG (Iannario et al., 26 Sep 2025).

A stable bootstrap-aggregated extension is also defined. “Stable latent MMHC” repeats the full latent MMHC procedure on $Z_j = \Phi^{-1}(F_j(X_j)),$0 bootstrap resamples and aggregates the learned graphs using bnlearn’s averaged.network and inclusion.threshold functions. Edge selection frequencies are computed, and only edges with sufficient support are retained in the consensus graph. In the focused stability study, the design fixes $Z_j = \Phi^{-1}(F_j(X_j)),$1, $Z_j = \Phi^{-1}(F_j(X_j)),$2, $Z_j = \Phi^{-1}(F_j(X_j)),$3, the SEM score, and $Z_j = \Phi^{-1}(F_j(X_j)),$4 in the skeleton phase (Iannario et al., 26 Sep 2025).

The paper is explicit about the trade-off embedded in this hybridization. The procedure gains orientation and interpretability relative to pure constraint-based copula learners, but it does not inherit the asymptotic consistency guarantees of pure PC-style methods, because greedy score search can get stuck in suboptimal DAGs (Iannario et al., 26 Sep 2025).

5. Simulation design and empirical behavior

The simulation benchmark is constructed from a Gaussian copula model whose latent variables obey a DAG. Configurations vary dimension, sample size, and sparsity, with $Z_j = \Phi^{-1}(F_j(X_j)),$5, $Z_j = \Phi^{-1}(F_j(X_j)),$6, and sparsity parameter $Z_j = \Phi^{-1}(F_j(X_j)),$7. Directed edges are generated only from lower-indexed to higher-indexed nodes; for each pair $Z_j = \Phi^{-1}(F_j(X_j)),$8 with $Z_j = \Phi^{-1}(F_j(X_j)),$9, an edge $F_j$0 is included independently with probability $F_j$1, and edge weights are drawn uniformly from $F_j$2 with random sign. Latent Gaussian data are sampled by

$F_j$3

Observed mixed data are created by transforming the first $F_j$4 variables into binary or ordinal variables and leaving the remaining $F_j$5 variables continuous (Iannario et al., 26 Sep 2025).

The benchmark compares copula PC, latent PC, a copula score-based method, a SEM score-based method, a latent score-based method, and four latent MMHC variants obtained by crossing Gauss versus SEM scoring with $F_j$6 versus $F_j$7 in the skeleton phase. Each configuration is replicated 100 times for graph generation, with 50 data replications per $F_j$8 used for summary metrics. Performance is measured by structural Hamming distance (SHD), sensitivity or edge recall (SEN), specificity (SPE), and runtime (Iannario et al., 26 Sep 2025).

The main empirical result is that latent MMHC dominates the competing learners in structural recovery, especially in its SEM-based form. For $F_j$9, latent MMHC (SEM) achieves the best or near-best SHD in almost all settings. For $X_j$0, latent MMHC (SEM, $X_j$1) has the lowest SHD in 7 of 8 settings. Sensitivity improves markedly over pure constraint-based methods, whose edge recall is comparatively low, while specificity remains high; the SEM-based latent MMHC variants often match or exceed the pure constraint-based learners in specificity, indicating that improved recall does not come at a major false-positive cost. Runtime is the principal trade-off: pure constraint-based or purely score-based methods are fastest, whereas latent MMHC, especially the SEM-based and more permissive variants, is more expensive at larger $X_j$2 and $X_j$3 (Iannario et al., 26 Sep 2025).

The stable bootstrap variant yields smaller but consistent benefits. In the focused $X_j$4 study, the bootstrap-aggregated graph tends to have slightly lower median SHD and reduced variability across replications. The paper characterizes this improvement as not dramatic, but aligned with the intended effect of aggregation: damping unstable edges and reinforcing recurring ones (Iannario et al., 26 Sep 2025).

6. Volleyball application and directed psychological profiling

The motivating application uses a dataset of 164 female volleyball players from the C and D leagues in Campania, Italy. The variables include demographic and sport-background information, Big Five personality scores, self-esteem, and eight IPPS-48 mental-skill scales. For this application, the authors fit the stable latent MMHC with SEM score and $X_j$5, using $X_j$6 bootstrap resamples because of the small sample size. They also forbid edges from psychological traits to lifestyle and sport-background variables, treating those background variables as exogenous (Iannario et al., 26 Sep 2025).

The resulting network concentrates on psychological variables. Under the imposed constraints, none of the sport- or lifestyle-related variables connect into the psychological core, so the final figure focuses on the trait network. Personality traits appear upstream. Neuroticism is central, influencing conscientiousness and worry; conscientiousness influences openness and agreeableness; extraversion is linked to agreeableness and higher self-esteem. The mental-skills subsystem is organized around goal setting and self-confidence: goal setting predicts self-confidence and propagates to mental practice and match preparation, and match preparation in turn drives self-talk. Self-confidence also feeds directly into self-esteem. Emotional arousal acts as a connector, tied to extraversion, goal setting, self-confidence, and worry, while concentration disruption contributes to worry (Iannario et al., 26 Sep 2025).

For the final discrete Bayesian network, the averaged continuous scores are rounded back to their original ordinal categories and fitted with Dirichlet-$X_j$7 Bayesian parameter estimation for all conditional probability tables. On top of the learned structure, the paper performs variance-based Sobol analyses and conditional probability analyses for selected outcomes including worry, self-confidence, match preparation, and self-esteem. It also reports six joint scenario profiles—high motivation/arousal, low motivation/arousal, skills boost, rehearsal focus, resilient extrovert, and vulnerable attentional profiles—to quantify how upstream configurations shift downstream outcome distributions (Iannario et al., 26 Sep 2025).

The paper’s broader claim is not that the learned directions constitute definitive causal proof. Rather, the directed network provides an interpretable structure for explanation, scenario propagation, and decision support in athlete development, within the usual observational-BN limits (Iannario et al., 26 Sep 2025).

7. Conceptual significance, relation to MMHC, and limitations

Latent MMHC inherits the conceptual strengths of the hybrid MMHC family while modifying both the statistical substrate and the orientation objective. Standard MMHC in the discrete/Gaussian setting is built around MMPC plus greedy hill-climbing, and later work on H2PC showed that improving the recall of the super-structure can substantially improve downstream fit and structural recovery, even at higher computational cost (Gasse et al., 2015, Gasse et al., 2015). Latent MMHC carries the same lesson into heterogeneous data: a constraint-based skeleton is used to regularize a second-stage DAG search, but the skeleton is now learned in latent Gaussian copula space and the search uses SEM- or Gaussian-based scores appropriate to the mixed-data setting (Iannario et al., 26 Sep 2025).

Its practical strengths are stated explicitly. It handles mixed data without ad hoc discretization during structure learning; it leverages rank-based estimation and robust dependence modeling within a latent Gaussian copula framework; it returns a single oriented DAG, which is more actionable than a CPDAG for explanation and intervention-oriented interpretation; and its bootstrap-stable version adds robustness in small samples (Iannario et al., 26 Sep 2025).

Its limitations are equally explicit. The hybrid search is computationally more expensive than pure constraint-based or pure score-based alternatives, especially with larger $X_j$8 and the SEM score. The full hybrid procedure lacks formal consistency guarantees because the greedy score stage can select suboptimal DAGs even with infinite data. The latent Gaussian copula remains a modeling assumption, and discrete margins may induce dependencies beyond the latent Gaussian structure. Finally, directional interpretation should remain within the standard observational-BN understanding rather than being treated as conclusive causal identification (Iannario et al., 26 Sep 2025).

Within the literature summarized here, latent MMHC is therefore best understood as a mixed-data descendant of MMHC’s hybrid architecture: it preserves the two-stage discipline of skeleton restriction followed by score-based DAG selection, but adapts both phases to latent-copula structure learning in order to obtain a single interpretable directed network for heterogeneous variables (Iannario et al., 26 Sep 2025).