DeepAI AI Chat
Log In Sign Up

Automated Analytic Asymptotic Evaluation of the Marginal Likelihood for Latent Models

by   Dmitry Rusakov, et al.

We present and implement two algorithms for analytic asymptotic evaluation of the marginal likelihood of data given a Bayesian network with hidden nodes. As shown by previous work, this evaluation is particularly hard for latent Bayesian network models, namely networks that include hidden variables, where asymptotic approximation deviates from the standard BIC score. Our algorithms solve two central difficulties in asymptotic evaluation of marginal likelihood integrals, namely, evaluation of regular dimensionality drop for latent Bayesian network models and computation of non-standard approximation formulas for singular statistics for these models. The presented algorithms are implemented in Matlab and Maple and their usage is demonstrated for marginal likelihood approximations for Bayesian networks with hidden variables.


page 1

page 2

page 3

page 4


Asymptotic Model Selection for Directed Networks with Hidden Variables

We extend the Bayesian Information Criterion (BIC), an asymptotic approx...

Asymptotic Model Selection for Naive Bayesian Networks

We develop a closed form asymptotic formula to compute the marginal like...

Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network

We discuss Bayesian methods for learning Bayesian networks when data set...

Learning networks determined by the ratio of prior and data

Recent reports have described that the equivalent sample size (ESS) in a...

Classifier Learning with Supervised Marginal Likelihood

It has been argued that in supervised classification tasks, in practice ...

Evidence bounds in singular models: probabilistic and variational perspectives

The marginal likelihood or evidence in Bayesian statistics contains an i...

On-line Bayesian System Identification

We consider an on-line system identification setting, in which new data ...