mlsanityData to 14 Oct 2026

Estimate Collapsibility of Causal Effects in Completed Partial DAGs via Strong d-Convex Hulls

arXiv 2606.08941 ↗First posted 8 Jun 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper proposes a collapsible method for estimating causal effects that maintains the estimator's consistency before and after marginalization over some variables in completed partially directed acyclic graphs (CPDAGs). We first introduce the estimate collapsibility for CPDAGs and characterize the minimal collapsible sets as strong d-convex hulls. An efficient algorithm is devised to obtain such sets in DAGs and is generalized to CPDAGs. Then, we combine the graph reduction procedure with the IDA framework. Finally, experiments and empirical analysis show the effectiveness of the collapsibility for causal estimations in CPDAGs. Code is available at https://github.com/Jamyang-D/strongly-convex.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 31 references that are in the map. First posted on arXiv 8 Jun 2026.

Builds on

4 of 31 references.

References · 4

  1. 2013Causal Inference and Causal Explanation with Background Knowledgecited by 170
  2. 2013Learning Equivalence Classes of Bayesian Networks Structurescited by 77
  3. 2018Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Frameworkcited by 16
  4. 2020Minimal enumeration of all possible total effects in a Markov equivalence classcited by 12

Built on by

Not cited yet.