Maximum a posteriori estimation by search in probabilistic programs

We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). Probabilistic programs represent probabilistic models with varying number of mutually dependent finite, countable, and contin...

Descrizione completa

Dettagli Bibliografici
Autori principali: Tolpin, D, Wood, F
Natura: Conference item
Pubblicazione: AAAI Publications 2015