pith. sign in

arxiv: 1612.07307 · v2 · pith:K2GHX466new · submitted 2016-12-21 · 💻 cs.LG

Loss is its own Reward: Self-Supervision for Reinforcement Learning

classification 💻 cs.LG
keywords learningrewardreinforcementlossesauxiliarydataefficiencyend-to-end
0
0 comments X
read the original abstract

Reinforcement learning optimizes policies for expected cumulative reward. Need the supervision be so narrow? Reward is delayed and sparse for many tasks, making it a difficult and impoverished signal for end-to-end optimization. To augment reward, we consider a range of self-supervised tasks that incorporate states, actions, and successors to provide auxiliary losses. These losses offer ubiquitous and instantaneous supervision for representation learning even in the absence of reward. While current results show that learning from reward alone is feasible, pure reinforcement learning methods are constrained by computational and data efficiency issues that can be remedied by auxiliary losses. Self-supervised pre-training and joint optimization improve the data efficiency and policy returns of end-to-end reinforcement learning.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Supervise Thyself: Examining Self-Supervised Representations in Interactive Environments

    cs.LG 2019-06 unverdicted novelty 5.0

    Empirical comparison finds that self-supervised representations vary in capturing agent state and generalizing to new levels or textures depending on environment visuals and dynamics.