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
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Black-box policy search with probabilistic programs
ανά: Van De Meent, J, κ.ά.
Έκδοση: (2016) -
Maximum a-Posteriori estimation of random fields.
Έκδοση: (2003) -
Maximum a Posteriori Estimation of Coupled Hidden Markov Models.
ανά: Rezek, I, κ.ά.
Έκδοση: (2002) -
Foundation of 2-Symbolic Plithogenic Maximum a Posteriori Estimation
ανά: Nizar Altounji, κ.ά.
Έκδοση: (2023-11-01) -
Output-sensitive Adaptive Metropolis-Hastings for probabilistic programs
ανά: Tolpin, D, κ.ά.
Έκδοση: (2015)