Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Asymptotic Model Selection for Directed Networks with Hidden Variables (1302.3580v2)

Published 13 Feb 2013 in cs.LG, cs.AI, and stat.ML

Abstract: We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be used to select models given large samples of data. The standard BIC as well as our extension punishes the complexity of a model according to the dimension of its parameters. We argue that the dimension of a Bayesian network with hidden variables is the rank of the Jacobian matrix of the transformation between the parameters of the network and the parameters of the observable variables. We compute the dimensions of several networks including the naive Bayes model with a hidden root node.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Dan Geiger (30 papers)
  2. David Heckerman (65 papers)
  3. Christopher Meek (34 papers)
Citations (91)

Summary

We haven't generated a summary for this paper yet.