Active Domain Randomization
Bhairav Mehta, Manfred Diaz, Florian Golemo, Christopher J. Pal, Liam, Paull

TL;DR
This paper introduces Active Domain Randomization, a method that adaptively samples environment parameters to improve agent generalization in domain randomization settings, outperforming traditional uniform sampling.
Contribution
It proposes a novel algorithm that learns an environment parameter sampling strategy based on policy rollout discrepancies, enhancing robustness and consistency of policies.
Findings
Active Domain Randomization improves policy robustness.
Adaptive sampling outperforms uniform sampling.
Method works across simulated and real-robot tasks.
Abstract
Domain randomization is a popular technique for improving domain transfer, often used in a zero-shot setting when the target domain is unknown or cannot easily be used for training. In this work, we empirically examine the effects of domain randomization on agent generalization. Our experiments show that domain randomization may lead to suboptimal, high-variance policies, which we attribute to the uniform sampling of environment parameters. We propose Active Domain Randomization, a novel algorithm that learns a parameter sampling strategy. Our method looks for the most informative environment variations within the given randomization ranges by leveraging the discrepancies of policy rollouts in randomized and reference environment instances. We find that training more frequently on these instances leads to better overall agent generalization. Our experiments across various physics-based…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Reinforcement Learning in Robotics · Topic Modeling
