Maximum a Posteriori Estimation by Search in Probabilistic Programs

  title={Maximum a Posteriori Estimation by Search in Probabilistic Programs},
  author={David Tolpin and Frank D. Wood},
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 continuous random variables. BaMC is an anytime MAP search algorithm applicable to any combination of random variables and dependencies. We compare BaMC to other MAP estimation algorithms and show that… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 9 times over the past 90 days. VIEW TWEETS
5 Citations
30 References
Similar Papers

Similar Papers

Loading similar papers…