paper-with-me

Papers

In Hindsight: A Smooth Reward for Steady Exploration

2019-06-24 · Hadi S. Jomaa, Josif Grabocka, Lars Schmidt-Thieme

In classical Q-learning, the objective is to maximize the sum of discounted rewards through iteratively using the Bellman equation as an update, in an attempt to estimate the action value function of the optimal policy. Conventionally, the loss function is defined as the temporal difference between the action value and the expected (discounted) reward, however it focuses solely on the future, leading to overestimation errors. We extend the well-established Q-learning techniques by introducing the hindsight factor, an additional loss term that takes into account how the model progresses, by integrating the historic temporal difference as part of the reward. The effect of this modification is examined in a deterministic continuous-state space function estimation problem, where the overestimation phenomenon is significantly reduced and results in improved stability. The underlying effect of the hindsight factor is modeled as an adaptive learning rate, which unlike existing adaptive optimizers, takes into account the previously estimated action value. The proposed method outperforms variations of Q-learning, with an overall higher average reward and lower action values, which supports the deterministic evaluation, and proves that the hindsight factor contributes to lower overestimation errors. The mean average score of 100 episodes obtained after training for 10 million frames shows that the hindsight factor outperforms deep Q-networks, double deep Q-networks and dueling networks for a variety of ATARI games.

📄 PDF Abstract BibTeX arXiv:1906.09781

Code (0)

등록된 구현이 없습니다.

Tasks

Atari GamesQ-Learning

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Curiosity-Driven Multi-Criteria Hindsight Experience Replay

2019-06-09 · John B. Lanier, Stephen Mcaleer, Pierre Baldi

Dealing with sparse rewards is a longstanding challenge in reinforcement learning. The recent use of hindsight methods have achieved success on a variety of sparse-reward tasks, but they fail on complex tasks such as sta…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Curiosity in Hindsight: Intrinsic Exploration in Stochastic Environments

2022-11-18 · Daniel Jarrett, Corentin Tallec, Florent Altché, Thomas Mesnard 외

Consider the problem of exploration in sparse-reward or reward-free environments, such as in Montezuma's Revenge. In the curiosity-driven paradigm, the agent is rewarded for how much each realized outcome differs from th…

Atari GamesMontezuma's Revenge

Imaginary Hindsight Experience Replay: Curious Model-based Learning for Sparse Reward Tasks

2021-10-05 · Robert McCarthy, Qiang Wang, Stephen J. Redmond

Model-based reinforcement learning is a promising learning strategy for practical robotic applications due to its improved data-efficiency versus model-free counterparts. However, current state-of-the-art model-based met…

FetchPush-v1Model-based Reinforcement LearningOpenAI Gym

Bootstrapped Hindsight Experience replay with Counterintuitive Prioritization

2021-09-29 · Jiawei Xu, Shuxing Li, Chun Yuan, Zhengyou Zhang 외

Goal-conditioned environments are known as sparse rewards tasks, in which the agent gains a positive reward only when it achieves the goal. Such an setting results in much difficulty for the agent to explore successful t…

Q-Learning

Exploration via Hindsight Goal Generation

2019-06-10 · NeurIPS 2019 12 · Zhizhou Ren, Kefan Dong, Yuan Zhou, Qiang Liu 외

Goal-oriented reinforcement learning has recently been a practical framework for robotic manipulation tasks, in which an agent is required to reach a certain goal defined by a function on the state space. However, the sp…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)