Sparse Latent Space Policy Search

Authors

  • Kevin Luck Arizona State University
  • Joni Pajarinen Aalto University
  • Erik Berger Technical University Bergakademie Freiberg
  • Ville Kyrki Aalto University
  • Heni Ben Amor Arizona State University

DOI:

https://doi.org/10.1609/aaai.v30i1.10272

Keywords:

Policy Search, Reinforcement Learning, Robotics, Dimensionality Reduction

Abstract

Computational agents often need to learn policies that involve many control variables, e.g., a robot needs to control several joints simultaneously. Learning a policy with a high number of parameters, however, usually requires a large number of training samples. We introduce a reinforcement learning method for sample-efficient policy search that exploits correlations between control variables. Such correlations are particularly frequent in motor skill learning tasks. The introduced method uses Variational Inference to estimate policy parameters, while at the same time uncovering a low-dimensional latent space of controls. Prior knowledge about the task and the structure of the learning agent can be provided by specifying groups of potentially correlated parameters. This information is then used to impose sparsity constraints on the mapping between the high-dimensional space of controls and a lower-dimensional latent space. In experiments with a simulated bi-manual manipulator, the new approach effectively identifies synergies between joints, performs efficient low-dimensional policy search, and outperforms state-of-the-art policy search methods.

Downloads

Published

2016-02-21

How to Cite

Luck, K., Pajarinen, J., Berger, E., Kyrki, V., & Ben Amor, H. (2016). Sparse Latent Space Policy Search. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10272

Issue

Section

Technical Papers: Machine Learning Methods