mlsanityData to 14 Oct 2026

Active Imitation Learning with Noisy Guidance

arXiv 2005.12801 ↗First posted 26 May 2020cs.LG cs.AI cs.CLcited by 15

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

Abstract (arXiv)

Imitation learning algorithms provide state-of-the-art results on many structured prediction tasks by learning near-optimal search policies. Such algorithms assume training-time access to an expert that can provide the optimal action at any queried state; unfortunately, the number of such queries is often prohibitive, frequently rendering these approaches impractical. To combat this query complexity, we consider an active learning setting in which the learning algorithm has additional access to a much cheaper noisy heuristic that provides noisy guidance. Our algorithm, LEAQI, learns a difference classifier that predicts when the expert is likely to disagree with the heuristic, and queries the expert only when necessary. We apply LEAQI to three sequence labeling tasks, demonstrating significantly fewer queries to the expert and comparable (or better) accuracies over a passive approach.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Placed in Imitation learning methods, one of 13 directions in Offline RL and imitation learning from data. Builds on 8 of its 47 references that are in the map. First posted on arXiv 26 May 2020.

Builds on

8 of 47 references.

References · 8

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,414
  3. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 803
  4. 2017SemEval 2017 Task 10: ScienceIE - Extracting Keyphrases and Relations from Scientific Publicationscited by 102
  5. 2015Active Learning from Weak and Strong Labelerscited by 22
  6. 2017SEARNN: Training RNNs with Global-Local Lossescited by 17
  7. 2014Bucking the Trend: Large-Scale Cost-Focused Active Learning for Statistical Machine Translationcited by 10
  8. 2017Replace or Retrieve Keywords In Documents at Scalecited by 3

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 2; 2023: 6; 2024: 2; 2025: 1.

15 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2025Sample-Efficient Expert Query Control in Active Imitation Learning via Conformal Prediction
  2. 2026Behavior Cloning is Not All You Need: The Optimality of On-Policy Distillation for Noisy Expert Feedback
  3. 2022Minimax Optimal Online Imitation Learning via Replay Estimation
  4. 2024Amortized nonmyopic active search via deep imitation learning
  5. 2023A Strong Baseline for Batch Imitation Learning
  6. 2025Reinforcement Learning via Implicit Imitation Guidance
  7. 2023Good Better Best: Self-Motivated Imitation Learning for noisy Demonstrations
  8. 2025The Pitfalls of Imitation Learning when Actions are Continuous