无需奖励信号,自动探索环境并迁移技能的强化学习新框架
ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy
- 多尺度熵优化,结合每回合与长期熵最大化提升探索效率
- 提出平均回合状态熵作为内在奖励,逼近理论最优解
- 用kNN图加速熵估计,计算成本大幅降低,适合长期学习
本文提出一种名为ELEMENT的新框架,即通过最大熵实现分段与终身探索的强化学习方法。该方法在无外部奖励条件下实现高效环境探索,并能有效将习得技能迁移到下游任务。首先,针对长期探索中状态熵奖励衰减和计算开销大的问题,引入每回合最大熵优化以加速搜索。其次,提出一种新的内在奖励——平均回合状态熵,为回合熵目标提供理论最优解。第三,为加速长期熵最大化,采用k近邻(kNN)图组织熵估计与更新过程,显著降低计算复杂度。ELEMENT在分段与终身探索设置下均显著优于现有最先进方法,适用于任务无关预训练、离线强化学习数据收集等场景。
原文摘要 · Abstract (English)
This paper proposes \emph{Episodic and Lifelong Exploration via Maximum ENTropy} (ELEMENT), a novel, multiscale, intrinsically motivated reinforcement learning (RL) framework that is able to explore environments without using any extrinsic reward and transfer effectively the learned skills to downstream tasks. We advance the state of the art in three ways. First, we propose a multiscale entropy optimization to take care of the fact that previous maximum state entropy, for lifelong exploration with millions of state observations, suffers from vanishing rewards and becomes very expensive computationally across iterations. Therefore, we add an episodic maximum entropy over each episode to speedup the search further. Second, we propose a novel intrinsic reward for episodic entropy maximization named \emph{average episodic state entropy} which provides the optimal solution for a theoretical upper bound of the episodic state entropy objective. Third, to speed the lifelong entropy maximization, we propose a $k$ nearest neighbors ($k$NN) graph to organize the estimation of the entropy and updating processes that reduces the computation substantially. Our ELEMENT significantly outperforms state-of-the-art intrinsic rewards in both episodic and lifelong setups. Moreover, it can be exploited in task-agnostic pre-training, collecting data for offline reinforcement learning, etc.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。