Vanishing Bias Heuristic-guided Reinforcement Learning Algorithm

2023-06-17 · Qinru Li, Hao Xiang

Reinforcement Learning has achieved tremendous success in the many Atari games. In this paper we explored with the lunar lander environment and implemented classical methods including Q-Learning, SARSA, MC as well as tiling coding. We also implemented Neural Network based methods including DQN, Double DQN, Clipped DQN. On top of these, we proposed a new algorithm called Heuristic RL which utilizes heuristic to guide the early stage training while alleviating the introduced human bias. Our experiments showed promising results for our proposed methods in the lunar lander environment.

📄 PDF Abstract BibTeX arXiv:2306.10216

Code (0)

등록된 구현이 없습니다.

Tasks

Atari GamesQ-Learningreinforcement-learning Reinforcement Learning

Methods 이 논문이 사용한 방법론

Double Q-learning Double Q-learning is an off-policy reinforcement learning algorithm that utilises double estimation to counteract overestimation problems with traditional Q-learning. The…

Experience Replay Experience Replay is a replay memory technique used in reinforcement learning where we store the agent’s experiences at each time-step, $e\_{t} = \left(s\_{t}, a\_{t}, r\_{t},…

DQN A DQN, or Deep Q-Network, approximates a state-value function in a Q-Learning framework with a neural network. In the Atari…

Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

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} +…

Double DQN 설명 없음

Heuristic-Guided Reinforcement Learning

2021-06-05 · NeurIPS 2021 12 · Ching-An Cheng, Andrey Kolobov, Adith Swaminathan

We provide a framework for accelerating reinforcement learning (RL) algorithms by heuristics constructed from domain knowledge or offline data. Tabula rasa RL algorithms require environment interactions or computation th…

Decision Making reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+1

Enhancing Q-Learning with Large Language Model Heuristics

2024-05-06 · Xiefeng Wu

Q-learning excels in learning from feedback within sequential decision-making tasks but often requires extensive sampling to achieve significant improvements. While reward shaping can enhance learning efficiency, non-pot…

Decision Making Language Modeling Language Modelling Large Language Model+4

The Mirror Langevin Algorithm Converges with Vanishing Bias

2021-09-24 · Ruilin Li, Molei Tao, Santosh S. Vempala, Andre Wibisono

The technique of modifying the geometry of a problem from Euclidean to Hessian metric has proved to be quite effective in optimization, and has been the subject of study for sampling. The Mirror Langevin Diffusion (MLD) …

Sampling Efficient Deep Reinforcement Learning through Preference-Guided Stochastic Exploration

2022-06-20 · Wenhui Huang, Cong Zhang, Jingda Wu, Xiangkun He 외

Massive practical works addressed by Deep Q-network (DQN) algorithm have indicated that stochastic policy, despite its simplicity, is the most frequently used exploration approach. However, most existing stochastic explo…

Atari Games Deep Reinforcement Learning Q-Learning reinforcement-learning+2

SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch

2024-12-20 · Shengyu Feng, Yiming Yang

Mixed Integer Linear Program (MILP) solvers are mostly built upon a Branch-and-Bound (B\&B) algorithm, where the efficiency of traditional solvers heavily depends on hand-crafted heuristics for branching. The past few ye…

Imitation Learning reinforcement-learning Reinforcement Learning