Variational Bayesian Optimization for Runtime Risk-Sensitive Control

By Scott Kuindersma, R. Grupen, Andrew Barto. 2012

23 citations recorded by the source corpus.

We present a new Bayesian policy search algorithm suitable for problems with policy-dependent cost variance, a property present in many robot control tasks. We extend recent work on variational heteroscedastic Gaussian processes to the optimization case to achieve efficient minimization of very noisy cost signals. In contrast to most policy search algorithms, our method explicitly models the cost variance in regions of low expected cost and permits runtime adjustment of risk sensitivity without relearning. Our experiments with artificial systems and a real mobile manipulator demonstrate that flexible risk-sensitive policies can be learned in very few trials.

Subfields: 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 Reinforcement Learning

  1. Sergey Levine
  2. Pieter Abbeel
  3. Emma Brunskill
  4. Ofir Nachum
  5. Peter Stone
  6. Chelsea Finn
  7. Lihong Li
  8. Shixiang Shane Gu

In Probabilistic & Bayesian Methods

  1. Sergey Levine
  2. Pieter Abbeel
  3. Teodor Mihai Moldovan
  4. Emma Brunskill
  5. Philip S. Thomas
  6. Bruno Castro da Silva
  7. Michael I. Jordan
  8. Andrew Barto

Citations in the corpus