Pith. Sign in

RECORD

Robust Deep Reinforcement Learning through Bootstrapped Opportunistic Curriculum

Machine Learning · Submitted 21 Jun 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In our experiments we show that the proposed BCL framework enables dramatic improvements in robustness of learned policies to adversarial perturbations.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2206.10057 (version 2)
Pith IDAA6JNME7, Pith's permanent record of this paper and its review
CitationJunlin Wu, Yevgeniy Vorobeychik. "Robust Deep Reinforcement Learning through Bootstrapped Opportunistic Curriculum." arXiv:2206.10057 (2022). https://pith.science/paper/AA6JNME7
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,671 input tokens.

What the abstract itself states, as probabilities: claims first 0.10 · states limitation 0.10 · human participants 0.02 · controlled comparison 0.78 · randomized assignment 0.02 · states quantitative result 0.99 · compares with prior results 0.98 · mentions code or data availability 0.99.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Despite considerable advances in deep reinforcement learning, it has been shown to be highly vulnerable to adversarial perturbations to state observations. Recent efforts that have attempted to improve adversarial robustness of reinforcement learning can nevertheless tolerate only very small perturbations, and remain fragile as perturbation size increases. We propose Bootstrapped Opportunistic Adversarial Curriculum Learning (BCL), a novel flexible adversarial curriculum learning framework for robust reinforcement learning. Our framework combines two ideas: conservatively bootstrapping each curriculum phase with highest quality solutions obtained from multiple runs of the previous phase, and opportunistically skipping forward in the curriculum. In our experiments we show that the proposed BCL framework enables dramatic improvements in robustness of learned policies to adversarial perturbations. The greatest improvement is for Pong, where our framework yields robustness to perturbations of up to 25/255; in contrast, the best existing approach can only tolerate adversarial noise up to 5/255. Our code is available at: https://github.com/jlwu002/BCL.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Despite considerable advances in deep reinforcement learning, it has been shown to be highly vulnerable to adversarial perturbations to state observations. background 0.99 0.07 0.02 asserted 1.00
s1 Recent efforts that have attempted to improve adversarial robustness of reinforcement learning can nevertheless tolerate only very small perturbations, and remain fragile as perturbation size increases. gap 0.60 0.05 0.02 asserted 1.00
s2 We propose Bootstrapped Opportunistic Adversarial Curriculum Learning (BCL), a novel flexible adversarial curriculum learning framework for robust reinforcement learning. contribution 0.98 0.82 0.10 asserted 0.99
s3 Our framework combines two ideas: conservatively bootstrapping each curriculum phase with highest quality solutions obtained from multiple runs of the previous phase, and opportunistically skipping forward in the curriculum. method 0.96 0.71 0.04 asserted 0.97
s4 In our experiments we show that the proposed BCL framework enables dramatic improvements in robustness of learned policies to adversarial perturbations. result 0.99 0.96 0.68 asserted 1.00
s5 The greatest improvement is for Pong, where our framework yields robustness to perturbations of up to 25/255; in contrast, the best existing approach can only tolerate adversarial noise up to 5/255. result 1.00 0.96 0.35 asserted 1.00
s6 Our code is available at: https://github.com/jlwu002/BCL. contribution 0.61 0.42 0.01 asserted 0.86

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.87.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Despite considerable advances in deep reinforcement learning, it has been shown to be highly vulnerable to adversarial perturbations to state observations. Recent efforts that have attempted to improve adversarial robustness of reinforcement learning can nevertheless tolerate only very small perturbations, and remain fragile as perturbation size increases. We propose Bootstrapped Opportunistic Adversarial Curriculum Learning (BCL), a novel flexible adversarial curriculum learning framework for robust reinforcement learning. Our framework combines two ideas: conservatively bootstrapping each curriculum phase with highest quality solutions obtained from multiple runs of the previous phase, and opportunistically skipping forward in the curriculum. In our experiments we show that the proposed BCL framework enables dramatic improvements in robustness of learned policies to adversarial perturbations. The greatest improvement is for Pong, where our framework yields robustness to perturbations of up to 25/255; in contrast, the best existing approach can only tolerate adversarial noise up to 5/255. Our code is available at: https://github.com/jlwu002/BCL.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 4 sentences without a confident label

Contests 1 paper
Cites as background 5 papers
  • Studies of adversarial state perturbations to policies learned using deep reinforcement learning are somewhat more recent [ref] , as are approaches for increasing robustness [ref] .

    Delving into adversarial attacks on deep policies · Related Work · 0.94

  • Studies of adversarial state perturbations to policies learned using deep reinforcement learning are somewhat more recent [ref] , as are approaches for increasing robustness [ref] .

    Noisy Networks for Exploration · Related Work · 0.94

  • Studies of adversarial state perturbations to policies learned using deep reinforcement learning are somewhat more recent [ref] , as are approaches for increasing robustness [ref] .

    Whatever Does Not Kill Deep Reinforcement Learning, Makes It Stronger · Related Work · 0.94

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.