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...

詳細記述

書誌詳細
主要な著者: Tolpin, D, Wood, F
フォーマット: Conference item
出版事項: AAAI Publications 2015

類似資料