mlsanityData to 14 Oct 2026

Knowledge Transfer from Teachers to Learners in Growing-Batch Reinforcement Learning

arXiv 2305.03870 ↗First posted 5 May 2023cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Standard approaches to sequential decision-making exploit an agent's ability to continually interact with its environment and improve its control policy. However, due to safety, ethical, and practicality constraints, this type of trial-and-error experimentation is often infeasible in many real-world domains such as healthcare and robotics. Instead, control policies in these domains are typically trained offline from previously logged data or in a growing-batch manner. In this setting a fixed policy is deployed to the environment and used to gather an entire batch of new data before being aggregated with past batches and used to update the policy. This improvement cycle can then be repeated multiple times. While a limited number of such cycles is feasible in real-world domains, the quality and diversity of the resulting data are much lower than in the standard continually-interacting approach. However, data collection in these domains is often performed in conjunction with human experts, who are able to label or annotate the collected data. In this paper, we first explore the trade-offs present in this growing-batch setting, and then investigate how information provided by a teacher (i.e., demonstrations, expert actions, and gradient information) can be leveraged at training time to mitigate the sample complexity and coverage requirements for actor-critic methods. We validate our contributions on tasks from the DeepMind Control Suite.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 5 May 2023.

Builds on

21 of 32 references.

References · 21

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  3. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
  4. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,809
  5. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  6. 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,293
  7. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
  8. 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 782
  9. 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 671
  10. 2018Maximum a Posteriori Policy Optimisationcited by 328
  11. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 286
  12. 2020Critic Regularized Regressioncited by 275
9 more
  1. 2021Offline Reinforcement Learning with Fisher Divergence Critic Regularizationcited by 238
  2. 2020Keep Doing What Worked: Behavioral Modelling Priors for Offline Reinforcement Learningcited by 215
  3. 2018Distributed Distributional Deterministic Policy Gradientscited by 199
  4. 2022Jump-Start Reinforcement Learningcited by 112
  5. 2019Benchmarking Batch Deep Reinforcement Learning Algorithmscited by 111
  6. 2022Reincarnating Reinforcement Learning: Reusing Prior Computation to Accelerate Progresscited by 65
  7. 2021The Difficulty of Passive Learning in Deep Reinforcement Learningcited by 50
  8. 2021Regularized Behavior Value Estimationcited by 32
  9. 2018When Simple Exploration is Sample Efficient: Identifying Sufficient Conditions for Random Exploration to Yield PAC RL Algorithmscited by 11

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.