The reviewed record of science sign in
Pith

arxiv: 2502.07891 · v2 · pith:EKZ6YFTS · submitted 2025-02-11 · stat.ML · cs.LG· quant-ph

The Observational Partial Order of Causal Structures with Latent Variables

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EKZ6YFTSrecord.jsonopen to challenge →

classification stat.ML cs.LGquant-ph
keywords variablesvisibleclassesconstraintsobservationalcausaldistributionsequivalence
0
0 comments X
read the original abstract

For two causal structures with the same set of visible variables, one is said to observationally dominate the other if the set of distributions over the visible variables realizable by the first contains the set of distributions over the visible variables realizable by the second. Knowing such dominance relations is useful for adjudicating between these structures given observational data. We here consider the problem of determining the partial order of equivalence classes of causal structures with latent variables relative to observational dominance. We provide a complete characterization of the dominance order in the case of three visible variables, and a partial characterization in the case of four visible variables. Our techniques also help to identify which observational equivalence classes have a set of realizable distributions that is characterized by nontrivial inequality constraints, analogous to Bell inequalities and instrumental inequalities. We find evidence that as one increases the number of visible variables, the equivalence classes satisfying nontrivial inequality constraints become ubiquitous. (Because such classes are the ones for which there can be a difference in the distributions that are quantumly and classically realizable, this implies that the potential for quantum-classical gaps is also ubiquitous.) Furthermore, we find evidence that constraint-based causal discovery algorithms that rely solely on conditional independence constraints have a significantly weaker distinguishing power among observational equivalence classes than algorithms that go beyond these (i.e., algorithms that also leverage nested Markov constraints and inequality constraints).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.