Name
Abstract | ||
|---|---|---|
We consider a problem of learning the reward and policy from expert examples under unknown dynamics. Our proposed method builds on the framework of generative adversarial networks and introduces the empowerment-regularized maximum-entropy inverse reinforcement learning to learn near-optimal rewards and policies. Empowerment-based regularization prevents the policy from overfitting to expert demonstrations, which advantageously leads to more generalized behaviors that result in learning near-optimal rewards. Our method simultaneously learns empowerment through variational information maximization along with the reward and policy under the adversarial learning formulation. We evaluate our approach on various high-dimensional complex control tasks. We also test our learned rewards in challenging transfer learning problems where training and testing environments are made to be different from each other in terms of dynamics or structure. The results show that our proposed method not only learns near-optimal rewards and policies that are matching expert behavior but also performs significantly better than state-of-the-art inverse reinforcement learning algorithms. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Learning | Transfer of learning,Regularization (mathematics),Imitation,Artificial intelligence,Overfitting,Generative grammar,Maximization,Mathematics,Machine learning,Adversarial system,Empowerment |
DocType | Volume | Citations |
Journal | abs/1809.06404 | 2 |
PageRank | References | Authors |
0.36 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed Hussain Qureshi | 1 | 54 | 8.83 |
| Michael C. Yip | 2 | 140 | 24.72 |