HackerPapers

arXiv:1802.10567cs.LG

Learning by Playing - Solving Sparse Reward Tasks from Scratch

Martin Riedmiller, Roland Hafner, Thomas Lampe, Michael Neunert, Jonas Degrave, Tom Van de Wiele, Volodymyr Mnih, Nicolas Heess, Jost Tobias Springenberg

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in the context of Reinforcement Learning (RL). SAC-X enables learning of complex behaviors - from scratch - in the presence of multiple sparse reward signals. To this end, the agent is equipped with a set of general auxiliary tasks, that it attempts to learn simultaneously via off-policy RL. The key idea behind our method is that active (learned) scheduling and execution of auxiliary policies allows the agent to efficiently explore its environment - enabling it to excel at sparse reward RL. Our experiments in several challenging robotic manipulation settings demonstrate the power of our approach.

arXiv comments
A video of the rich set of learned behaviours can be found at https://youtu.be/mPKyvocNe_M
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.RORobotics stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2018 to Jun 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. AI Nationalism 1 comment
    • Exacerbated by sparse rewards. Well, it is being tackled as everything else. [0] for example. [0] https://arxiv.org/pdf/1802.10567.pdf

      red75primeView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.