HackerPapers

arXiv:1703.05407cs.LG

Intrinsic Motivation and Automatic Curricula via Asymmetric Self-Play

Sainbayar Sukhbaatar, Zeming Lin, Ilya Kostrikov, Gabriel Synnaeve, Arthur Szlam, Rob Fergus

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

Abstract

We describe a simple scheme that allows an agent to learn about its environment in an unsupervised manner. Our scheme pits two versions of the same agent, Alice and Bob, against one another. Alice proposes a task for Bob to complete; and then Bob attempts to complete the task. In this work we will focus on two kinds of environments: (nearly) reversible environments and environments that can be reset. Alice will "propose" the task by doing a sequence of actions and then Bob must undo or repeat them, respectively. Via an appropriate reward structure, Alice and Bob automatically generate a curriculum of exploration, enabling unsupervised training of the agent. When Bob is deployed on an RL task within the environment, this unsupervised training reduces the number of supervised episodes needed to learn, and in some cases converges to a higher reward.

arXiv comments
Published in ICLR 2018
Journal reference
DOI
Subjects
cs.LGMachine Learning

On Hacker News

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

Comments linking this paper, per year.

Discussed in comments1 thread

    • Let's say you're reading this research paper: https://arxiv.org/pdf/1703.05407.pdf I want to know: "In Rob Fergus' paper intrinsic motivation and self-play, how is it that the reward for agent A can be based on the time taken for agent B's task, when agent A and B are run…

      richard___View on HNParent context

Submitted to Hacker News

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