Timezone: »

Policy Gradient Bayesian Robust Optimization for Imitation Learning
Zaynah Javed · Daniel Brown · Satvik Sharma · Jerry Zhu · Ashwin Balakrishna · Marek Petrik · Anca Dragan · Ken Goldberg

Tue Jul 20 06:40 PM -- 06:45 PM (PDT) @

The difficulty in specifying rewards for many real-world problems has led to an increased focus on learning rewards from human feedback, such as demonstrations. However, there are often many different reward functions that explain the human feedback, leaving agents with uncertainty over what the true reward function is. While most policy optimization approaches handle this uncertainty by optimizing for expected performance, many applications demand risk-averse behavior. We derive a novel policy gradient-style robust optimization approach, PG-BROIL, that optimizes a soft-robust objective that balances expected performance and risk. To the best of our knowledge, PG-BROIL is the first policy optimization algorithm robust to a distribution of reward hypotheses which can scale to continuous MDPs. Results suggest that PG-BROIL can produce a family of behaviors ranging from risk-neutral to risk-averse and outperforms state-of-the-art imitation learning algorithms when learning from ambiguous demonstrations by hedging against uncertainty, rather than seeking to uniquely identify the demonstrator's reward function.

Author Information

Zaynah Javed (UC Berkeley)
Daniel Brown (UC Berkeley)
Satvik Sharma (University of California, Berkeley)
Jerry Zhu (UC Berkeley)
Ashwin Balakrishna (University of California, Berkeley)
Marek Petrik (University of New Hampshire)
Anca Dragan (University of California, Berkeley)
Ken Goldberg (UC Berkeley)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors