Cited by 111Reinforcement Learning in RoboticsDomain Adaptation and Few-Shot LearningRobot Manipulation and Learning

Generalization in Reinforcement Learning by Soft Data Augmentation

Open access
Hansen, Nicklas, Wang, Xiaolong·2021·2021 IEEE International Conference on Robotics and Automation (ICRA)

Abstract

Extensive efforts have been made to improve the generalization ability of Reinforcement Learning (RL) methods via domain randomization and data augmentation. However, as more factors of variation are introduced during training, optimization becomes increasingly challenging, and empirically may result in lower sample efficiency and unstable training. Instead of learning policies directly from augmented data, we propose SOft Data Augmentation (SODA), a method that decouples augmentation from policy learning. Specifically, SODA imposes a soft constraint on the encoder that aims to maximize the mutual information between latent representations of augmented and non-augmented data, while the RL optimization process uses strictly non-augmented data. Empirical evaluations are performed on diverse tasks from DeepMind Control suite as well as a robotic manipulation task, and we find SODA to significantly advance sample efficiency, generalization, and stability in training over state-of-the-art vision-based RL methods.1

Integrity signals

Registry

Crossref · 10.1109/icra48506.2021.9561103

Cites

48 of 48 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Soft Data Augmentation improves sample efficiency and stabilises reinforcement learning optimisation by decoupling data augmentation from policy learning.

    “Soft Data Augmentation (SODA) [142] further improves sample efficiency and stabilises the RL optimisation by decoupling data augmentation from policy learning.”
  • Deep reinforcement learning encoders suffer from observation overfitting, so data augmentation can improve data efficiency and generalisation ability of a DRL agent.

    “In general, DRL encoders suffer from observation overfitting [160,161], so DA can also be used to improve data efficiency and generalisation ability of a DRL agent [141,142].”
  • Many benchmarks and datasets with perturbations have been specifically defined or curated as part of various BC or reinforcement learning works, but they do not provide a unified framework to evaluate all potential perturbations for generalization.

    “Additionally, many of the benchmarks and datasets with perturbations have been specifically defined or curated as part of various BC or reinforcement learning works [76, 24, 71]. However, they do not provide an unified framework to evaluate all potential perturbations for generalization, primarily because they are not the main focus of these works.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Hansen, N., & Wang, X.
Affiliations
University of California San Diego (US)
Venue
2021 IEEE International Conference on Robotics and Automation (ICRA)
Publisher
IEEE
Published
2021-05-30
Pages
13611-13617
ISSN
1050-4729 (ISSN-L)
OpenAlex
W3205321526
Cited by
111
References
48
Citations by year
2026: 6 · 2025: 26 · 2024: 29 · 2023: 28 · 2022: 15 · 2021: 7
FWCI
9.12
Type
conference paper
Language
en
Open access
Locations
  • Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • eScholarship (California Digital Library) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1730158, 1541349)
  • Defense Advanced Research Projects Agency
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Engineering › Control and Systems Engineering › Robot Manipulation and Learning
Keywords
generalization, reinforcement learning, domain randomization, mutual information maximization, vision-based reinforcement learning, sample efficiency, robotic manipulation, DeepMind Control Suite

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review