Saved in:
Bibliographic Details
Main Authors: Chang, Hyunwoong, Taskin, Fariha
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.15639
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913131980128256
author Chang, Hyunwoong
Taskin, Fariha
author_facet Chang, Hyunwoong
Taskin, Fariha
contents We propose a joint order-based scoring framework for causal structure learning of directed acyclic graph (DAG) models under heterogeneous data settings. We show that leveraging heterogeneity improves the accuracy of causal ordering estimation. In the most favorable case, the causal ordering is identifiable up to two permutations. Building on this framework, we propose an order-based Bayesian method for Gaussian DAG models and establish its theoretical properties in the high-dimensional regime. For posterior inference over the space of orderings, we introduce a random-to-random (R2R) proposal neighborhood for the Metropolis-Hastings algorithm, which is theoretically motivated and exhibits efficient mixing behavior. Simulation studies confirm the strong empirical performance of the proposed method, and an application to single-nucleus RNA sequencing data from major depressive disorder demonstrates practical utility.
format Preprint
id arxiv_https___arxiv_org_abs_2605_15639
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Leveraging heterogeneity for identifiability: Bayesian order-based learning of multiple DAGs
Chang, Hyunwoong
Taskin, Fariha
Methodology
Computation
Machine Learning
We propose a joint order-based scoring framework for causal structure learning of directed acyclic graph (DAG) models under heterogeneous data settings. We show that leveraging heterogeneity improves the accuracy of causal ordering estimation. In the most favorable case, the causal ordering is identifiable up to two permutations. Building on this framework, we propose an order-based Bayesian method for Gaussian DAG models and establish its theoretical properties in the high-dimensional regime. For posterior inference over the space of orderings, we introduce a random-to-random (R2R) proposal neighborhood for the Metropolis-Hastings algorithm, which is theoretically motivated and exhibits efficient mixing behavior. Simulation studies confirm the strong empirical performance of the proposed method, and an application to single-nucleus RNA sequencing data from major depressive disorder demonstrates practical utility.
title Leveraging heterogeneity for identifiability: Bayesian order-based learning of multiple DAGs
topic Methodology
Computation
Machine Learning
url https://arxiv.org/abs/2605.15639