Skip to content
conftrace_
2026 PGM PGM 2026

Partially Ordering Graphical Models with Latent Confounders by their Equality Constraints

A linear structural equation model can represent causal relations and latent confounders between its variables by means of directed and bidirected edges. The set of distributions in such a graphical model can be difficult to describe: conditional independence constraints do not suffice in this case, so more general equality constraints are needed. We present an algorithm that can check whether two linear structural equation models differ by an equality constraint. Using this algorithm, we empirically study the partially ordered set of these models, for different subclasses of mixed graphs. We show that for some of these classes, a natural generalization of Meek’s conjecture does not hold. We also investigate what set of constraints is needed to distinguish the models for various classes of graphs.

More from PGM 2026

All PGM 2026 papers →