Black-box policy search with probabilistic programs
In this work we show how to represent policies as programs: that is, as stochastic simulators with tunable parameters. To learn the parameters of such policies we develop connections between black box variational inference and existing policy search approaches. We then explain how such learning can...
Main Authors: | Van De Meent, J, Paige, B, Tolpin, D, Wood, F |
---|---|
Format: | Conference item |
Published: |
Journal of Machine Learning Research
2016
|
Similar Items
-
Output-sensitive Adaptive Metropolis-Hastings for probabilistic programs
by: Tolpin, D, et al.
Published: (2015) -
Maximum a posteriori estimation by search in probabilistic programs
by: Tolpin, D, et al.
Published: (2015) -
Bayesian Optimization for Probabilistic Programs
by: Rainforth, T, et al.
Published: (2016) -
Particle Gibbs with Ancestor Sampling for Probabilistic Programs
by: van de Meent, J, et al.
Published: (2015) -
Particle Gibbs with ancestor sampling for probabilistic programs
by: Meent, J, et al.
Published: (2015)