Black-Box Policy Search with Probabilistic Programs

By Jan-Willem van de Meent, Brooks Paige, David Tolpin, Frank D. Wood. 2015

25 citations recorded by the source corpus.

In this work, we explore how probabilistic programs can be used to represent policies in sequential decision problems. In this formulation, a probabilistic program is a black-box stochastic simulator for both the problem domain and the agent. We relate classic policy gradient techniques to recently introduced black-box variational methods which generalize to probabilistic program inference. We present case studies in the Canadian traveler problem, Rock Sample, and a benchmark for optimal diagnosis inspired by Guess Who. Each study illustrates how programs can efficiently represent policies using moderate numbers of parameters.

Subfields: Artificial Intelligence, Reinforcement Learning, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Francisco J. R. Ruiz
  2. Michalis K. Titsias
  3. David M. Blei
  4. Hao Cui
  5. Roni Khardon
  6. Qiang Liu
  7. Stephan Mandt
  8. Rajesh Ranganath

In Reinforcement Learning

  1. Francisco J. R. Ruiz
  2. Hao Cui
  3. Michalis K. Titsias
  4. Roni Khardon
  5. David M. Blei

In Probabilistic & Bayesian Methods

  1. Francisco J. R. Ruiz
  2. Michalis K. Titsias
  3. David M. Blei
  4. Hao Cui
  5. Roni Khardon
  6. Qiang Liu
  7. Rajesh Ranganath
  8. Richard E. Turner

Citations in the corpus