Self-supervised network distillation: an effective approach to exploration in sparse reward environments
Matej Pecháč, Michal Chovanec, Igor Farkaš
TL;DR
This work tackles sparse reward exploration in reinforcement learning by introducing Self-supervised Network Distillation (SND), a framework where a learnable target model is trained through self-supervision and its distillation error guides exploration. It generalizes Random Network Distillation by updating the target representation with three self-supervised losses: SND-V (contrastive), SND-STD (ST-DIM-based), and SND-VIC (VICReg-based). Across ten challenging environments (Atari and ProcGen), SND variants yield faster learning and higher external rewards than baselines, with intrinsic rewards that remain informative and do not vanish. The study also provides analytical evidence that richer, decorrelated, and more discriminative feature spaces underlie the observed improvements, suggesting SND as a versatile intrinsic-motivation tool for sparse-reward RL with practical implications for open-ended and autonomous learning.
Abstract
Reinforcement learning can solve decision-making problems and train an agent to behave in an environment according to a predesigned reward function. However, such an approach becomes very problematic if the reward is too sparse and so the agent does not come across the reward during the environmental exploration. The solution to such a problem may be to equip the agent with an intrinsic motivation that will provide informed exploration during which the agent is likely to also encounter external reward. Novelty detection is one of the promising branches of intrinsic motivation research. We present Self-supervised Network Distillation (SND), a class of intrinsic motivation algorithms based on the distillation error as a novelty indicator, where the predictor model and the target model are both trained. We adapted three existing self-supervised methods for this purpose and experimentally tested them on a set of ten environments that are considered difficult to explore. The results show that our approach achieves faster growth and higher external reward for the same training time compared to the baseline models, which implies improved exploration in a very sparse reward environment. In addition, the analytical methods we applied provide valuable explanatory insights into our proposed models.
