Cited by 528Reinforcement Learning in RoboticsAdvanced Bandit Algorithms ResearchArtificial Intelligence in Games

Exploration in deep reinforcement learning: A survey

Open access
Ladosz, Pawel, Weng, Lilian, Kim, Minwoo, Oh, Hyondong·2022·Information Fusion

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.inffus.2022.03.003

Cites

186 of 186 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Solving detachment and derailment requires a good global exploration strategy that can better balance long-term and short-term environment information.

    “Solving these problems requires a good global exploration strategy [211] that can better balance long-term and short-term environment information [195].”

    From Data-Driven Robotic Manipulation of Cloth-like Deformable Objects: The Present, Challenges and Future Prospects (2023) · cites this paper as [195]

    The citation to this survey attaches to the need for a good global exploration strategy, not to the later claim about balancing long- and short-term information. Section 2.2 (p. 4) says exploration is useful when local minima or flat rewards obstruct a solution, and the Introduction (p. 2) calls for more sophisticated exploration algorithms. Our copy does not connect a global strategy specifically to solving detachment and derailment. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • The exploration component of RL has long been recognized as a critical driver for emergent behavior in traditional RL.

    “While underappreciated in current reasoning literature, the exploration component of RL has long been recognized as a critical driver for emergent behavior in traditional RL (Yue et al., 2025; Silver et al., 2016; Ladosz et al., 2022; Pourcel et al., 2024).”

    From Absolute Zero: Reinforced Self-play Reasoning with Zero Data (2025) · cites this paper as Ladosz et al., 2022

  • Conversational AI is dedicated to developing AI systems capable of smooth, natural, and context-aware human-computer interactions, focusing on dialogue modeling, question answering, user intent recognition, and multi-turn context tracking.

    “This subdomain is dedicated to developing AI systems capable of smooth, natural, and context-aware human-computer interactions, by focusing on dialogue modeling, question answering, user intent recognition, and multi-turn context tracking [204], [205], [206], [207].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. [12][12] B. Eysenbach, A. Gupta, J. Ibarz, S. Levine, Diversity Is All You Need, 7th International Conference on Learning Representations, ICLR 2019 (2019). URL: https://openreview.net/pdf?id=SJx63jRqFm . -
  2. [24][24] Exploration, https://dictionary.cambridge.org/dictionary/ english/exploration , 2020. Accessed: 2020-04-09. -
  3. [83][83] T. Gangwani, Q. Liu, J. Peng, Learning Self-Imitating Diverse Policies, 7th International Conference on Learning Representations, ICLR 2019 (2019). -
  4. [89][89] Y. Guo, J. Choi, M. Moczulski, S. Feng, S. Bengio, M. Norouzi, H. Lee, Memory Based Trajectory-conditioned Policies for Learning from Sparse Rewards, Conference on Neural Information Processing Systems, NeurIPS 2020 (2020). -

Cited by

Sorted by citations

Authors
Ladosz, P., Weng, L., Kim, M., & Oh, H.
Affiliations
  • OpenAI (United States) (US)
  • Ulsan National Institute of Science and Technology (KR)
Corresponding author
Oh, Hyondong
Venue
Information Fusion
Publisher
Elsevier BV
Published
2022-09
Volume
85
Pages
1-22
ISSN
1566-2535 (ISSN-L)
OpenAlex
W4220747123
Cited by
525
References
185
Citations by year
2026: 112 · 2025: 198 · 2024: 149 · 2023: 59 · 2022: 7
FWCI
33.97
Type
journal article
Language
en
Open access
Locations
  • Information Fusion (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Research Explorer (The University of Manchester) (submittedVersion, cc-by-nc-nd)
  • Scholarworks@UNIST (Ulsan National Institute of Science and Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Ministry of Science, ICT and Future Planning (2020M3C1C1A01082375, 2020R1F1A1049066)
  • National Research Foundation of Korea
  • Ministry of Education (2020R1A6A1A03040570)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
Keywords
safe exploration, random exploration, reward learning

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