Local markov equivalence for pc-style local causal discovery and identification of controlled direct effects
Abstract
Identifying controlled direct effects (CDEs) is crucial across numerous scientific domains. While existing methods can identify these effects from causal directed acyclic graphs (DAGs), the true DAG is often unknown in practice. Essential graphs, which represent a Markov equivalence class of DAGs characterized by the same set of conditional independencies, provide a more practical and realistic alternative, and the PC algorithm is one of the most widely used method to learn them using conditional independence tests. However, learning the full essential graph is computationally intensive and relies on strong, untestable assumptions. In this work, we adapt the PC algorithm to recover only the portion of the graph needed for identifying CDEs. In particular, we introduce the local essential graph (LEG), a graph structure defined relative to a target variable, and present LocPC, an algorithm that learns the LEG using solely local conditional independence tests. Building on this, we develop LocPC-CDE, which extracts precisely the portion of the LEG that is both necessary and sufficient for identifying a CDE. Compared to global methods, our algorithms require less conditional independence tests and operate under weaker assumptions while maintaining theoretical guarantees. We illustrate the effectiveness of our approach on synthetic and real data.
Related
- QCMI-Based Quantum Markov Blanket Discovery for Semantic Quantum Networks
- Selective inference for false discovery proportion in a hidden Markov model
- A structural analysis of U.S. homelessness through Markov random fields: Identifying predictors and potential causal links through permutation tests
- On the Computational Complexity of Hidden Markov Model Identification
- Interpretable Causal Discovery via Causal-Effect Constraints
BibTeX
@article{loranchet2026local,
title = {{Local markov equivalence for pc-style local causal discovery and identification of controlled direct effects}},
author = {Timothée Loranchet and Charles K Assaad},
journal = {Proceedings of Machine Learning Research},
year = {2026},
month = oct,
url = {https://hal.science/hal-05700848v1},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Local markov equivalence for pc-style local causal discovery and identification of controlled direct effects
AU - Timothée Loranchet
AU - Charles K Assaad
PY - 2026
DA - 2026/10/14
JO - Proceedings of Machine Learning Research
UR - https://hal.science/hal-05700848v1
AB - Identifying controlled direct effects (CDEs) is crucial across numerous scientific domains. While existing methods can identify these effects from causal directed acyclic graphs (DAGs), the true DAG is often unknown in practice. Essential graphs, which represent a Markov equivalence class of DAGs characterized by the same set of conditional independencies, provide a more practical and realistic alternative, and the PC algorithm is one of the most widely used method to learn them using conditional independence tests. However, learning the full essential graph is computationally intensive and relies on strong, untestable assumptions. In this work, we adapt the PC algorithm to recover only the portion of the graph needed for identifying CDEs. In particular, we introduce the local essential graph (LEG), a graph structure defined relative to a target variable, and present LocPC, an algorithm that learns the LEG using solely local conditional independence tests. Building on this, we develop LocPC-CDE, which extracts precisely the portion of the LEG that is both necessary and sufficient for identifying a CDE. Compared to global methods, our algorithms require less conditional independence tests and operate under weaker assumptions while maintaining theoretical guarantees. We illustrate the effectiveness of our approach on synthetic and real data.
SN - 1938-7228
SN - 2640-3498
ER -