arrow
返回

Sampling Efficient Deep Reinforcement Learning Through Preference-Guided Stochastic Exploration

delete2024-12-01
delete4
delete
OA
AI
H
Huang, Wenhui
C
Cong Zhang
J
Jingda Wu
X
Xiangkun He
J
Jie Zhang
C
Chen Lv *
DOI:10.1109/TNNLS.2023.3317628delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Stochastic exploration is the key to the success of the deep Q-network (DQN) algorithm. However, most existing stochastic exploration approaches either explore actions heuristically regardless of their Q values or couple the sampling with Q values, which inevitably introduce bias into the learning process. In this article, we propose a novel preference-guided epsilon-greedy exploration algorithm that can efficiently facilitate exploration for DQN without introducing additional bias. Specifically, we design a dual architecture consisting of two branches, one of which is a copy of DQN, namely, the Q branch. The other branch, which we call the preference branch, learns the action preference that the DQN implicitly follows. We theoretically prove that the policy improvement theorem holds for the preference-guided epsilon-greedy policy and experimentally show that the inferred action preference distribution aligns with the landscape of corresponding Q values. Intuitively, the preference-guided epsilon-greedy exploration motivates the DQN agent to take diverse actions, so that actions with larger Q values can be sampled more frequently, and those with smaller Q values still have a chance to be explored, thus encouraging the exploration. We comprehensively evaluate the proposed method by benchmarking it with well-known DQN variants in nine different environments. Extensive results confirm the superiority of our proposed method in terms of performance and convergence speed.
Keyword:
Data efficiency
deep Q network (DQN)
deep reinforcement learning (DRL)
preference-guided exploration
stochastic policy

期刊

IEEE Transactions on Neural Networks and Learning Systems 封面图
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
论文数:
7.6K
被引数:
7.2W

机构

N
nanyang technological university
学者数:
1.4K
论文数: 694
被引数: 0
引用论文

引用论文

err分享
err收藏
An electrophoretic e‐paper device with stretchable, washable, and rewritable functions
err2022-04-29
err0
PREAI
errZhiguang Qiu; Simu Zhu; Hao Lu; Yifan Gu; Ziyi Wu; Gaofan Zhang; Shaozhi Deng; Bo‐Ru Yang
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Analysis on smart material suitable for autogenous microelectronic application
err2019-08-30
err0
PREAI
errR Sitharthan; Manimaran Ponnusamy; Madurakavi Karthikeyan; D Shanmuga Sundar
err分享
err收藏
Model-Free λ-Policy Iteration for Discrete-Time Linear Quadratic Regulation
err2023-02-01
err121
PREAI
errYang, Yongliang; Kiumarsi, Bahare; Modares, Hamidreza; Xu, Chengzhong
err分享
err收藏
学者 查看更多内容