Efficient Exploration In Deep Reinforcement Learning: A Novel Bayesian Actor-critic Algorithm
2024 Β· Nikolai Rozanov
Abstract
Reinforcement learning (RL) and Deep Reinforcement Learning (DRL), in particular, have the potential to disrupt and are already changing the way we interact with the world. One of the key indicators of their applicability is their ability to scale and work in real-world scenarios, that is in large-scale problems. This scale can be achieved via a combination of factors, the algorithm's ability to make use of large amounts of data and computational resources and the efficient exploration of the environment for viable solutions (i.e. policies). In this work, we investigate and motivate some theoretical foundations for deep reinforcement learning. We start with exact dynamic programming and work our way up to stochastic approximations and stochastic approximations for a model-free scenario, which forms the theoretical basis of modern reinforcement learning. We present an overview of this highly varied and rapidly changing field from the perspective of Approximate Dynamic Programming. We
Authors
(none)
Tags
Stats
Related papers
- Broad Critic Deep Actor Reinforcement Learning For Continuous Control (2024)0.00
- Bounded Exploration With World Model Uncertainty In Soft Actor-critic Reinforcement Learning Algorithm (2024)0.00
- Deep Exploration With Pac-bayes (2024)0.00
- Behavior-guided Actor-critic: Improving Exploration Via Learning Policy Behavior Representation For Deep Reinforcement Learning (2021)0.00
- Guided Exploration In Reinforcement Learning Via Monte Carlo Critic Optimization (2022)0.00
- Boosting Exploration In Actor-critic Algorithms By Incentivizing Plausible Novel States (2022)5.24
- Ensemble Reinforcement Learning In Continuous Spaces -- A Hierarchical Multi-step Approach For Policy Training (2022)2.26
- A Single-loop Deep Actor-critic Algorithm For Constrained Reinforcement Learning With Provable Convergence (2023)5.24