Bayesian Approach to Linear Bayesian Networks
Not on the map. Why?
Abstract (arXiv)
This study proposes the first Bayesian approach for learning high-dimensional linear Bayesian networks. The proposed approach iteratively estimates each element of the topological ordering from backward and its parent using the inverse of a partial covariance matrix. The proposed method successfully recovers the underlying structure when Bayesian regularization for the inverse covariance matrix with unequal shrinkage is applied. Specifically, it shows that the number of samples n = Omega( dM2 log p) and n = Omega(dM2 p2/m) are sufficient for the proposed algorithm to learn linear Bayesian networks with sub-Gaussian and 4m-th bounded-moment error distributions, respectively, where p is the number of nodes and dM is the maximum degree of the moralized graph. The theoretical findings are supported by extensive simulation studies including real data analysis. Furthermore the proposed method is demonstrated to outperform state-of-the-art frequentist approaches, such as the BHLSM, LISTEN, and TD algorithms in synthetic data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 34 references that are in the map. First posted on arXiv 27 Nov 2023.
Builds on
11 of 34 references.
References · 11
- 2013High-dimensional learning of linear causal networks via inverse covariance estimationcited by 87
- 2018On Causal Discovery with Equal Variance Assumptioncited by 59
- 2017Learning linear structural equation models in polynomial time and sample complexitycited by 51
- 2020Towards Scalable Bayesian Learning of Causal DAGscited by 33
- 2017Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexitycited by 27
- 2017Learning Quadratic Variance Function (QVF) DAG models via OverDispersion Scoring (ODS)cited by 18
- 2022Optimal estimation of Gaussian DAG modelscited by 17
- 2013A Bayesian Approach to Learning Bayesian Networks with Local Structurecited by 15
- 2018Bayesian Regularization for Graphical Models with Unequal Shrinkagecited by 5
- 2015Scaling It Up: Stochastic Search Structure Learning in Graphical Modelscited by 4
- 2021Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layerscited by 1
Built on by
Not cited yet.