Understanding Bonus-Based Exploration in Reinforcement Learning

Intrinsic reward-based exploration methods have successfully solved challenging sparse reward tasks such as Montezuma’s Revenge. However, these methods have not been widely adopted in reinforcement learning due to inconsistent performance gains across tasks. To better understand the underlying cause of this variability, we evaluate the performance of three major families of exploration methods on a suite of custom environments and video games: prediction error, state visitation and model uncertainty. Our custom environments allow us to study the effect of different environmental features in isolation. Our results reveal that exploration methods can be biased by spurious features such as color, and prioritize different dynamics in specific environments. In particular, we find that prediction-based methods are superior at solving tasks involving controllable dynamics. Furthermore, we find that partial observability can hinder exploration by setting up "curiosity traps" that agents can fall into. Finally, we investigate how various implementation details such as reward design and generation affect an agent’s overall performance.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2021

Author dc:creator

• Chen, Eric

Advisor dc:contributor.advisor

• Agrawal, Pulkit

Statement dc:rights

• In Copyright - Educational Use Permitted
• Copyright MIT

Licence dc:rights.uri

• http://rightsstatements.org/page/InC-EDU/1.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/140193

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/140193