Cited by 116Adversarial Robustness in Machine LearningReinforcement Learning in RoboticsAdaptive Dynamic Programming Control

Adversarially Robust Policy Learning: Active construction of physically-plausible perturbations

Mandlekar, Ajay, Zhu, Yuke, Garg, Animesh, Fei-Fei, Li, Savarese, Silvio·2017·2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Abstract

Policy search methods in reinforcement learning have demonstrated success in scaling up to larger problems beyond toy examples. However, deploying these methods on real robots remains challenging due to the large sample complexity required during learning and their vulnerability to malicious intervention. We introduce Adversarially Robust Policy Learning (ARPL), an algorithm that leverages active computation of physically-plausible adversarial examples during training to enable robust policy learning in the source domain and robust performance under both random and adversarial input perturbations. We evaluate ARPL on four continuous control tasks and show superior resilience to changes in physical environment dynamics parameters and environment state as compared to state-of-the-art robust policy learning methods. Code, data, and additional experimental results are available at: stanfordvl.github.io/ARPL.

Integrity signals

Registry

Crossref · 10.1109/iros.2017.8206245

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Mandlekar, A., Zhu, Y., Garg, A., Fei-Fei, L., & Savarese, S.
Affiliations
Stanford University (US)
Venue
2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Publisher
IEEE
Published
2017-09
Pages
3932-3939
ISSN
2153-0858 (ISSN-L)
OpenAlex
W2773691349
Cited by
116
References
40
Citations by year
2026: 3 · 2025: 4 · 2024: 12 · 2023: 15 · 2022: 12 · 2021: 28 · 2020: 21 · 2019: 16 · 2018: 5
FWCI
5.24
Type
conference paper
Language
en
Open access
closed
Locations
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Adaptive Dynamic Programming Control
Keywords
adversarial robustness, policy search, adversarial examples, continuous control, robot learning, robust policy learning, sample complexity

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