arrow
返回

Proximal Parameter Distribution Optimization

delete2021-06-01
delete9
PRE
AI
X
Xuesong Wang
T
Tianyi Li
Y
Yuhu Cheng *
DOI:10.1109/TSMC.2019.2931946delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Encouraging the agent to explore has become a hot topic in the field of reinforcement learning (RL). The popular approaches to engage in exploration are mainly by injecting noise into neural network (NN) parameters or by augmenting additional intrinsic motivation term. However, the randomness of injecting noise and the metric for intrinsic reward must be chosen manually may make RL agents deviate from the optimal policy during the learning process. To enhance the exploration ability of agent and simultaneously ensure the stability of parameter learning, we proposed a novel proximal parameter distribution optimization (PPDO) algorithm. On the one hand, PPDO enhances the exploration ability of RL agent by transforming NN parameter from a certain single value to a function distribution. On the other hand, PPDO accelerates the parameter distribution optimization by setting two groups of parameters. The parameter optimization is guided by evaluating the parameter quality change before and after the parameter distribution update. In addition, PPDO reduces the influence of bias and variance on the value function approximation by limiting the amplitude of the two consecutive parameter updates, which can enhance the stability of the parameter distribution optimization. Experiments on the OpenAI Gym, Atari, and MuJoCo platforms indicate that PPDO can improve the exploration ability and learning efficiency of deep RL algorithms, including DQN and A3C.
Keyword:
Optimization
Task analysis
Artificial neural networks
Noise measurement
Uncertainty
Reinforcement learning
Acceleration
Exploration
optimization
parameter distribution
reinforcement learning (RL)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions
err2012-03-01
err122
PREAI
errGelly, Sylvain; Kocsis, Levente; Schoenauer, Marc; Sebag, Michele; Silver, David; Szepesvari, Csaba; Teytaud, Olivier
err分享
err收藏
学者 查看更多内容