Average Reward Adjusted Discounted Reinforcement Learning: Near-blackwell-optimal Policies For Real-world Applications
2020 · Manuel Schneckenreither
Abstract
Although in recent years reinforcement learning has become very popular the number of successful applications to different kinds of operations research problems is rather scarce. Reinforcement learning is based on the well-studied dynamic programming technique and thus also aims at finding the best stationary policy for a given Markov Decision Process, but in contrast does not require any model knowledge. The policy is assessed solely on consecutive states (or state-action pairs), which are observed while an agent explores the solution space. The contributions of this paper are manifold. First we provide deep theoretical insights to the widely applied standard discounted reinforcement learning framework, which give rise to the understanding of why these algorithms are inappropriate when permanently provided with non-zero rewards, such as costs or profit. Second, we establish a novel near-Blackwell-optimal reinforcement learning algorithm. In contrary to former method it assesses the av
Authors
(none)
Tags
Stats
Related papers
- Examining Average And Discounted Reward Optimality Criteria In Reinforcement Learning (2021)0.00
- A Nearly Blackwell-optimal Policy Gradient Method (2021)0.00
- Clinician-in-the-loop Decision Making: Reinforcement Learning With Near-optimal Set-valued Policies (2020)0.00
- Average-reward Reinforcement Learning With Trust Region Methods (2021)0.00
- Learning Fair Policies In Multiobjective (deep) Reinforcement Learning With Average And Discounted Rewards (2020)0.00
- Regret-optimal Model-free Reinforcement Learning For Discounted Mdps With Short Burn-in Time (2023)0.00
- Performance Bounds For Policy-based Average Reward Reinforcement Learning Algorithms (2023)2.26
- Analyzing And Bridging The Gap Between Maximizing Total Reward And Discounted Reward In Deep Reinforcement Learning (2024)0.00