mlsanityData to 7 Oct 2026

Addressing pitfalls in implicit unobserved confounding synthesis using explicit block hierarchical ancestral sampling

arXiv 2503.09194 ↗First posted 12 Mar 2025stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

Unbiased data synthesis is crucial for evaluating causal discovery algorithms in the presence of unobserved confounding, given the scarcity of real-world datasets. A common approach, implicit parameterization, encodes unobserved confounding by modifying the off-diagonal entries of the idiosyncratic covariance matrix while preserving positive definiteness. Within this approach, we identify that state-of-the-art protocols have two distinct issues that hinder unbiased sampling from the complete space of causal models: first, we give a detailed analysis of use of diagonally dominant constructions restricts the spectrum of partial correlation matrices; and second, the restriction of possible graphical structures when sampling bidirected edges, unnecessarily ruling out valid causal models. To address these limitations, we propose an improved explicit modeling approach for unobserved confounding, leveraging block-hierarchical ancestral generation of ground truth causal graphs. Algorithms for converting the ground truth DAG into ancestral graph is provided so that the output of causal discovery algorithms could be compared with. We draw connections between implicit and explicit parameterization, prove that our approach fully covers the space of causal models, including those generated by the implicit parameterization, thus enabling more robust evaluation of methods for causal discovery and inference.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 39 references that are in the map. First posted on arXiv 12 Mar 2025.

Builds on

9 of 39 references.

References · 9

  1. 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 159
  2. 2017Causal Consistency of Structural Equation Modelscited by 114
  3. 2019Approximate Causal Abstractioncited by 62
  4. 2020Differentiable Causal Discovery Under Unmeasured Confoundingcited by 56
  5. 2013ParceLiNGAM: A causal ordering method robust against latent confounderscited by 29
  6. 2022CausalBench: A Large-scale Benchmark for Network Inference from Single-cell Perturbation Datacited by 29
  7. 2020Causal Discovery with Unobserved Confounding and non-Gaussian Datacited by 24
  8. 2022Characterization and Greedy Learning of Gaussian Structural Causal Models under Unknown Interventionscited by 12
  9. 2021Benchpress: A Scalable and Versatile Workflow for Benchmarking Structure Learning Algorithmscited by 11

Built on by

Not cited yet.