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...
Glavni autori: | Tolpin, D, Wood, F |
---|---|
Format: | Conference item |
Izdano: |
AAAI Publications
2015
|
Slični predmeti
-
Black-box policy search with probabilistic programs
od: Van De Meent, J, i dr.
Izdano: (2016) -
Maximum a-Posteriori estimation of random fields.
Izdano: (2003) -
Maximum a Posteriori Estimation of Coupled Hidden Markov Models.
od: Rezek, I, i dr.
Izdano: (2002) -
Foundation of 2-Symbolic Plithogenic Maximum a Posteriori Estimation
od: Nizar Altounji, i dr.
Izdano: (2023-11-01) -
Output-sensitive Adaptive Metropolis-Hastings for probabilistic programs
od: Tolpin, D, i dr.
Izdano: (2015)