mlsanityData to 7 Oct 2026

Methodical Advice Collection and Reuse in Deep Reinforcement Learning

arXiv 2204.07254 ↗First posted 14 Apr 2022cs.LG cs.AI cs.MAcited by 1

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning (RL) has shown great success in solving many challenging tasks via use of deep neural networks. Although using deep learning for RL brings immense representational power, it also causes a well-known sample-inefficiency problem. This means that the algorithms are data-hungry and require millions of training samples to converge to an adequate policy. One way to combat this issue is to use action advising in a teacher-student framework, where a knowledgeable teacher provides action advice to help the student. This work considers how to better leverage uncertainties about when a student should ask for advice and if the student can model the teacher to ask for less advice. The student could decide to ask for advice when it is uncertain or when both it and its model of the teacher are uncertain. In addition to this investigation, this paper introduces a new method to compute uncertainty for a deep RL agent using a secondary neural network. Our empirical results show that using dual uncertainties to drive advice collection and reuse may improve learning performance across several Atari games.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 30 references that are in the map. First posted on arXiv 14 Apr 2022.

Builds on

6 of 30 references.

References · 6

  1. 2018Optimization of Molecules via Deep Reinforcement Learningcited by 199
  2. 2018Generalization and Regularization in DQNcited by 117
  3. 2018Learning to Teach in Cooperative Multiagent Reinforcement Learningcited by 45
  4. 2021Action Advising with Advice Imitation in Deep Reinforcement Learningcited by 10
  5. 2020Student-Initiated Action Advising via Advice Noveltycited by 7
  6. 2021Learning on a Budget via Teacher Imitationcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.