Efficient Scheduling of Data Augmentation for Deep Reinforcement Learning
Byungchan Ko, Jungseul Ok

TL;DR
This paper introduces an adaptive scheduling framework for data augmentation in deep reinforcement learning, improving sample efficiency and generalization by optimally timing augmentation and distillation processes.
Contribution
It proposes a novel framework that automatically schedules data augmentation and distillation in RL, including a stand-alone distillation method and a strategy to postpone augmentation for better performance.
Findings
Postponing augmentation enhances RL training efficiency.
Adaptive scheduling improves generalization without extra samples.
The framework outperforms fixed augmentation schedules.
Abstract
In deep reinforcement learning (RL), data augmentation is widely considered as a tool to induce a set of useful priors about semantic consistency and improve sample efficiency and generalization performance. However, even when the prior is useful for generalization, distilling it to RL agent often interferes with RL training and degenerates sample efficiency. Meanwhile, the agent is forgetful of the prior due to the non-stationary nature of RL. These observations suggest two extreme schedules of distillation: (i) over the entire training; or (ii) only at the end. Hence, we devise a stand-alone network distillation method to inject the consistency prior at any time (even after RL), and a simple yet efficient framework to automatically schedule the distillation. Specifically, the proposed framework first focuses on mastering train environments regardless of generalization by adaptively…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Modular Robots and Swarm Intelligence
