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...
Huvudupphovsmän: | Tolpin, D, Wood, F |
---|---|
Materialtyp: | Conference item |
Publicerad: |
AAAI Publications
2015
|
Liknande verk
Liknande verk
-
Black-box policy search with probabilistic programs
av: Van De Meent, J, et al.
Publicerad: (2016) -
Maximum a-Posteriori estimation of random fields.
Publicerad: (2003) -
Maximum a Posteriori Estimation of Coupled Hidden Markov Models.
av: Rezek, I, et al.
Publicerad: (2002) -
Foundation of 2-Symbolic Plithogenic Maximum a Posteriori Estimation
av: Nizar Altounji, et al.
Publicerad: (2023-11-01) -
Output-sensitive Adaptive Metropolis-Hastings for probabilistic programs
av: Tolpin, D, et al.
Publicerad: (2015)