Neighboring State-based Exploration For Reinforcement Learning

Abstract

Reinforcement Learning is a powerful tool to model decision-making processes. However, it relies on an exploration-exploitation trade-off that remains an open challenge for many tasks. In this work, we study neighboring state-based, model-free exploration led by the intuition that, for an early-stage agent, considering actions derived from a bounded region of nearby states may lead to better actions when exploring. We propose two algorithms that choose exploratory actions based on a survey of nearby states, and find that one of our methods, \(\{\rho\}\)-explore, consistently outperforms the Double DQN baseline in an discrete environment by 49% in terms of Eval Reward Return.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyli2022neighboring

Related papers

• Exploration In Feature Space For Reinforcement Learning (2017)0.00
• DQN With Model-based Exploration: Efficient Learning On Environments With Sparse Rewards (2019)0.00
• Generative Adversarial Exploration For Reinforcement Learning (2022)0.00
• Exploring Unknown States With Action Balance (2020)0.00
• Exploration Conscious Reinforcement Learning Revisited (2018)0.00
• Learning-driven Exploration For Reinforcement Learning (2019)6.45
• Never Give Up: Learning Directed Exploration Strategies (2020)0.00
• Sampling Efficient Deep Reinforcement Learning Through Preference-guided Stochastic Exploration (2022)8.09