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...
Autori principali: | Van De Meent, J, Paige, B, Tolpin, D, Wood, F |
---|---|
Natura: | Conference item |
Pubblicazione: |
Journal of Machine Learning Research
2016
|
Documenti analoghi
Documenti analoghi
-
Output-sensitive Adaptive Metropolis-Hastings for probabilistic programs
di: Tolpin, D, et al.
Pubblicazione: (2015) -
Maximum a posteriori estimation by search in probabilistic programs
di: Tolpin, D, et al.
Pubblicazione: (2015) -
Bayesian Optimization for Probabilistic Programs
di: Rainforth, T, et al.
Pubblicazione: (2016) -
Particle Gibbs with Ancestor Sampling for Probabilistic Programs
di: van de Meent, J, et al.
Pubblicazione: (2015) -
Particle Gibbs with ancestor sampling for probabilistic programs
di: Meent, J, et al.
Pubblicazione: (2015)