Affine Transport for Sim-to-Real Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Sample-efficient domain adaptation is an open problem in robotics. In this paper, we present affine transport -- a variant of optimal transport, which models the mapping between state transition distributions between the source and target domains with an affine transformation. First, we derive the affine transport framework; then, we extend the basic framework with Procrustes alignment to model arbitrary affine transformations. We evaluate the method in a number of OpenAI Gym sim-to-sim experiments with simulation environments, as well as on a sim-to-real domain adaptation task of a robot hitting a hockeypuck such that it slides and stops at a target position. In each experiment, we evaluate the results when transferring between each pair of dynamics domains. The results show that affine transport can significantly reduce the model adaptation error in comparison to using the original, non-adapted dynamics model.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 22 references that are in the map. First posted on arXiv 25 May 2021.
Builds on
11 of 22 references.
References · 11
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2016OpenAI Gymcited by 1,684
- 2020MOPO: Model-based Offline Policy Optimizationcited by 630
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2015Return of Frustratingly Easy Domain Adaptationcited by 389
- 2020Sim-to-Real Transfer in Deep Reinforcement Learning for Robotics: a Surveycited by 388
- 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
- 2020A survey on domain adaptation theory: learning bounds and theoretical guaranteescited by 109
- 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.