Adaptive Bayesian Structure Learning of DAGs With Non-conjugate Prior

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Nazari, S., Arashi, M., Sadeghkhani, A.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929488957276160
author Nazari, S.
Arashi, M.
Sadeghkhani, A.
author_facet Nazari, S.
Arashi, M.
Sadeghkhani, A.
contents Directed Acyclic Graphs (DAGs) are solid structures used to describe and infer the dependencies among variables in multivariate scenarios. Having a thorough comprehension of the accurate DAG-generating model is crucial for causal discovery and estimation. Our work suggests utilizing a non-conjugate prior for Gaussian DAG structure learning to enhance the posterior probability. We employ the idea of using the Bessel function to address the computational burden, providing faster MCMC computation compared to the use of conjugate priors. In addition, our proposal exhibits a greater rate of adaptation when compared to the conjugate prior, specifically for the inclusion of nodes in the DAG-generating model. Simulation studies demonstrate the superior accuracy of DAG learning, and we obtain the same maximum a posteriori and median probability model estimate for the AML data, using the non-conjugate prior.
format Preprint
id arxiv_https___arxiv_org_abs_2403_17489
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Adaptive Bayesian Structure Learning of DAGs With Non-conjugate Prior
Nazari, S.
Arashi, M.
Sadeghkhani, A.
Methodology
Directed Acyclic Graphs (DAGs) are solid structures used to describe and infer the dependencies among variables in multivariate scenarios. Having a thorough comprehension of the accurate DAG-generating model is crucial for causal discovery and estimation. Our work suggests utilizing a non-conjugate prior for Gaussian DAG structure learning to enhance the posterior probability. We employ the idea of using the Bessel function to address the computational burden, providing faster MCMC computation compared to the use of conjugate priors. In addition, our proposal exhibits a greater rate of adaptation when compared to the conjugate prior, specifically for the inclusion of nodes in the DAG-generating model. Simulation studies demonstrate the superior accuracy of DAG learning, and we obtain the same maximum a posteriori and median probability model estimate for the AML data, using the non-conjugate prior.
title Adaptive Bayesian Structure Learning of DAGs With Non-conjugate Prior
topic Methodology
url https://arxiv.org/abs/2403.17489