mlsanityData to 7 Oct 2026

Active Policy Improvement from Multiple Black-box Oracles

arXiv 2306.10259 ↗First posted 17 Jun 2023cs.LG cs.AI stat.MLcited by 11

On the map: Offline RL and imitation learning from data → Imitation learning methods

Abstract (arXiv)

Reinforcement learning (RL) has made significant strides in various complex domains. However, identifying an effective policy via RL often necessitates extensive exploration. Imitation learning aims to mitigate this issue by using expert demonstrations to guide exploration. In real-world scenarios, one often has access to multiple suboptimal black-box experts, rather than a single optimal oracle. These experts do not universally outperform each other across all states, presenting a challenge in actively deciding which oracle to use and in which state. We introduce MAPS and MAPS-SE, a class of policy improvement algorithms that perform imitation learning from multiple suboptimal oracles. In particular, MAPS actively selects which of the oracles to imitate and improve their value function estimates, and MAPS-SE additionally leverages an active state exploration criterion to determine which states one should explore. We provide a comprehensive theoretical analysis and demonstrate that MAPS and MAPS-SE enjoy sample efficiency advantage over the state-of-the-art policy improvement algorithms. Empirical results show that MAPS-SE significantly accelerates policy optimization via state-wise imitation learning from multiple oracles across a broad spectrum of control tasks in the DeepMind Control Suite. Our code is publicly available at: https://github.com/ripl/maps.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Placed in Imitation learning methods, one of 13 directions in Offline RL and imitation learning from data. Builds on 17 of its 46 references that are in the map. First posted on arXiv 17 Jun 2023.

Builds on

17 of 46 references.

Closest ancestors · 2

Same direction, newest first

  1. 2022Imitation Learning by Estimating Expertise of Demonstrators2 Feb
  2. 2020Active Imitation Learning with Noisy Guidance26 May

Other references · 15

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  4. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  5. 2018DeepMind Control Suitecited by 935
  6. 2014Reinforcement and Imitation Learning via Interactive No-Regret Learningcited by 116
  7. 2020Hyperparameter Selection for Offline Reinforcement Learningcited by 113
  8. 2017Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential Predictioncited by 93
  9. 2021Benchmarks for Deep Off-Policy Evaluationcited by 89
  10. 2020Model Selection in Contextual Stochastic Bandit Problemscited by 71
  11. 2020Multi-expert learning of adaptive legged locomotioncited by 62
  12. 2019Model selection for contextual banditscited by 60
3 more
  1. 2020Offline Policy Selection under Uncertaintycited by 31
  2. 2021Active Offline Policy Selectioncited by 26
  3. 2022Learning from Multiple Expert Annotators for Enhancing Anomaly Detection in Medical Image Analysiscited by 13

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 4; 2025: 4.

11 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2020Policy Improvement via Imitation of Multiple Oracles ↗
  2. 2018Fast Policy Learning through Imitation and Reinforcement
  3. 2018Truncated Horizon Policy Search: Combining Reinforcement Learning & Imitation Learning
  4. 2019A New Framework for Query Efficient Active Imitation Learning
  5. 2025Beyond-Expert Performance with Limited Demonstrations: Efficient Imitation Learning with Double Exploration
  6. 2019Reward-Conditioned Policies
  7. 2022A Policy-Guided Imitation Approach for Offline Reinforcement Learning
  8. 2018Hierarchical Imitation and Reinforcement Learning