{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/140193"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/140193","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Understanding Bonus-Based Exploration in Reinforcement Learning","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chen, Eric"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Agrawal, Pulkit"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-09","date_published":"2021-09","updated_at":"2026-07-22T22:21:04Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/140193","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Agrawal, Pulkit"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Chen, Eric"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-02-07T15:29:34Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-02-07T15:29:34Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/140193"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Understanding Bonus-Based Exploration in Reinforcement Learning"]}]}],"canonical_facts":{"dc:contributor.advisor":["Agrawal, Pulkit"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Chen, Eric"],"dc:date.accessioned":["2022-02-07T15:29:34Z"],"dc:date.available":["2022-02-07T15:29:34Z"],"dc:date.issued":["2021-09"],"dc:description.abstract":["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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/140193"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Understanding Bonus-Based Exploration in Reinforcement Learning"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:21:04Z"}