Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes

01/11/2021
by   Quan Zhou, et al.
0

We consider MCMC methods for learning equivalence classes of sparse Gaussian DAG models when p = e^o(n). The main contribution of this work is a rapid mixing result for a random walk Metropolis-Hastings algorithm, which we prove using a canonical path method. It reveals that the complexity of Bayesian learning of sparse equivalence classes grows only polynomially in n and p, under some common high-dimensional assumptions. Further, a series of high-dimensional consistency results is obtained by the path method, including the strong selection consistency of an empirical Bayes model for structure learning and the consistency of a greedy local search on the restricted search space. Rapid mixing and slow mixing results for other structure-learning MCMC methods are also derived. Our path method and mixing time results yield crucial insights into the computational aspects of high-dimensional structure learning, which may be used to develop more efficient MCMC algorithms.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

05/29/2015

On the Computational Complexity of High-Dimensional Bayesian Variable Selection

We study the computational complexity of Markov chain Monte Carlo (MCMC)...
05/12/2021

Dimension-free Mixing for High-dimensional Bayesian Variable Selection

Yang et al. (2016) proved that the symmetric random walk Metropolis–Hast...
05/24/2022

Stereographic Markov Chain Monte Carlo

High dimensional distributions, especially those with heavy tails, are n...
09/25/2019

Rapid mixing of a Markov chain for an exponentially weighted aggregation estimator

The Metropolis-Hastings method is often used to construct a Markov chain...
01/04/2014

Concave Penalized Estimation of Sparse Gaussian Bayesian Networks

We develop a penalized likelihood estimation framework to estimate the s...
02/10/2022

Order-based Structure Learning without Score Equivalence

We consider the structure learning problem with all node variables havin...
06/30/2011

Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs

Although many algorithms have been designed to construct Bayesian networ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.