arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2007.14535cs.LGcs.AIcs.SYeess.SYstat.ML
收藏

做梦:无重构的潜在想象基于模型的强化学习

Dreaming: Model-based Reinforcement Learning by Latent Imagination without Reconstruction

Panasonic Corporation(松下公司);Ritsumeikan University(立命馆大学)

Masashi Okada, Tadahiro Taniguchi

摘要:

在本文中,我们提出了一个解码器免费扩展梦想家,领先的基于模型的强化学习(MBRL)方法从像素。Dreamer是机器人学习的样本和成本效益的解决方案,因为它用于基于变分自编码器的训练潜在状态空间模型,并通过潜在轨迹想象进行策略优化。然而,这种基于自动编码的方法通常会导致对象消失,其中自动编码器无法感知用于解决控制任务的关键对象,从而大大限制了Dreamer的潜力。本文的工作旨在通过去除解码器来缓解Dreamer的瓶颈,提高其性能。为此,我们首先从Dreamer的证据下界出发,推导出一个无似然、InfoMax的对比学习目标。其次,我们将两个组成部分,(i)独立的线性动力学和(ii)随机作物数据增强,学习计划,以提高训练性能。与Dreamer和其他最近的无模型强化学习方法相比,我们新设计的Dreamer具有InfoMax和没有生成解码器(Dreaming),在5个困难的模拟机器人任务中取得了最好的成绩,其中Dreamer遭受对象消失。

英文摘要:

In the present paper, we propose a decoder-free extension of Dreamer, a leading model-based reinforcement learning (MBRL) method from pixels. Dreamer is a sample- and cost-efficient solution to robot learning, as it is used to train latent state-space models based on a variational autoencoder and to conduct policy optimization by latent trajectory imagination. However, this autoencoding based approach often causes object vanishing, in which the autoencoder fails to perceives key objects for solving control tasks, and thus significantly limiting Dreamer's potential. This work aims to relieve this Dreamer's bottleneck and enhance its performance by means of removing the decoder. For this purpose, we firstly derive a likelihood-free and InfoMax objective of contrastive learning from the evidence lower bound of Dreamer. Secondly, we incorporate two components, (i) independent linear dynamics and (ii) the random crop data augmentation, to the learning scheme so as to improve the training performance. In comparison to Dreamer and other recent model-free reinforcement learning methods, our newly devised Dreamer with InfoMax and without generative decoder (Dreaming) achieves the best scores on 5 difficult simulated robotics tasks, in which Dreamer suffers from object vanishing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑