Loss Is Its Own Reward: Self-supervision For Reinforcement Learning

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.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyshelhamer2016loss

Related papers

• Intrinsically Motivated Self-supervised Learning In Reinforcement Learning (2021)3.58
• Reward-conditioned Policies (2019)0.00
• Learning Self-imitating Diverse Policies (2018)0.00
• When Does Self-prediction Help? Understanding Auxiliary Tasks In Reinforcement Learning (2024)0.00
• Return-based Contrastive Representation Learning For Reinforcement Learning (2021)12.17
• Policy Learning Using Weak Supervision (2020)0.00
• Continual Auxiliary Task Learning (2022)0.00
• Intrinsic Reward Policy Optimization For Sparse-reward Environments (2026)0.00