Conference item icon

Conference item

Black-box policy search with probabilistic programs

Abstract:

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 be implemented in a probabilistic programming system. Using our own novel implementation of such a system we demonstrate both conciseness of policy representation and automatic policy parameter lea...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
Publisher:
Journal of Machine Learning Research Publisher's website
Host title:
Proceedings of the Nineteenth International Conference on Artificial Intelligence and Statistics, May 09-11, 2016, Cadiz, Spain
Journal:
Proceedings of the Nineteenth International Conference on Artificial Intelligence and Statistics Journal website
Pages:
1195-1204
Publication date:
2016-05-09
Acceptance date:
2016-05-08
Event location:
Barcelona
EISSN:
1533-7928
ISSN:
1532-4435
Pubs id:
pubs:686827
UUID:
uuid:3a9151ae-c649-4b5f-bc81-afcf55b27eb6
Local pid:
pubs:686827
Source identifiers:
686827
Deposit date:
2017-03-23

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP