Exploration Conscious Reinforcement Learning Revisited

Abstract

The Exploration-Exploitation tradeoff arises in Reinforcement Learning when one cannot tell if a policy is optimal. Then, there is a constant need to explore new actions instead of exploiting past experience. In practice, it is common to resolve the tradeoff by using a fixed exploration mechanism, such as \(\epsilon\)-greedy exploration or by adding Gaussian noise, while still trying to learn an optimal policy. In this work, we take a different approach and study exploration-conscious criteria, that result in optimal policies with respect to the exploration mechanism. Solving these criteria, as we establish, amounts to solving a surrogate Markov Decision Process. We continue and analyze properties of exploration-conscious optimal policies and characterize two general approaches to solve such criteria. Building on the approaches, we apply simple changes in existing tabular and deep Reinforcement Learning algorithms and empirically demonstrate superior performance relatively to their non

Stats

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

Related papers

• Conservative Exploration In Reinforcement Learning (2020)0.00
• The Exploration-exploitation Dilemma Revisited: An Entropy Perspective (2024)0.00
• Is Exploration Or Optimization The Problem For Deep Reinforcement Learning? (2025)0.00
• Exploration And Incentives In Reinforcement Learning (2021)8.09
• Exploitation Is All You Need... For Exploration (2025)0.00
• Minimax-optimal Reward-agnostic Exploration In Reinforcement Learning (2023)0.00
• Satisficing Exploration For Deep Reinforcement Learning (2024)0.00
• Exploration In Feature Space For Reinforcement Learning (2017)0.00