A Lower Bound on the Partition Function of Attractive Graphical Models in the Continuous Case.
Nicholas RuozziPublished in: AISTATS (2017)
Keyphrases
- partition function
- graphical models
- approximate inference
- belief propagation
- lower bound
- undirected graphical models
- upper bound
- structure learning
- markov random field
- probabilistic inference
- probabilistic model
- closed form
- structured prediction
- probabilistic graphical models
- message passing
- loopy belief propagation
- exact inference
- factor graphs
- conditional random fields
- random fields
- random variables
- parameter estimation
- importance sampling
- markov networks
- upper and lower bounds
- probability density function
- bayesian networks
- belief networks
- conditional independence
- variational methods
- special case
- least squares
- maximum likelihood estimation
- gaussian process
- kalman filter
- monte carlo
- graph cuts
- markov chain