mlsanityData to 7 Oct 2026

Fully General Online Imitation Learning

arXiv 2102.08686 ↗First posted 17 Feb 2021cs.LG cs.AIcited by 4

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

Abstract (arXiv)

In imitation learning, imitators and demonstrators are policies for picking actions given past interactions with the environment. If we run an imitator, we probably want events to unfold similarly to the way they would have if the demonstrator had been acting the whole time. In general, one mistake during learning can lead to completely different events. In the special setting of environments that restart, existing work provides formal guidance in how to imitate so that events unfold similarly, but outside that setting, no formal guidance exists. We address a fully general setting, in which the (stochastic) environment and demonstrator never reset, not even for training purposes, and we allow our imitator to learn online from the demonstrator. Our new conservative Bayesian imitation learner underestimates the probabilities of each available action, and queries for more data with the remaining probability. Our main result: if an event would have been unlikely had the demonstrator acted the whole time, that event's likelihood can be bounded above when running the (initially totally ignorant) imitator instead. Meanwhile, queries to the demonstrator rapidly diminish in frequency. If any such event qualifies as "dangerous", our imitator would have the notable distinction of being relatively "safe".

Key facts. Cited by 4 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 5 of its 20 references that are in the map. First posted on arXiv 17 Feb 2021.

Builds on

5 of 20 references.

Closest ancestors · 2

Same direction, newest first

  1. 2020Bayesian Robust Optimization for Imitation Learning24 Jul
  2. 2018EnsembleDAgger: A Bayesian Approach to Safe Imitation Learning22 Jul

Other references · 3

  1. 2019Risk-Aware Active Inverse Reinforcement Learningcited by 26
  2. 2020Pessimism About Unknown Unknowns Inspires Conservatismcited by 13
  3. 2019Asymptotically Unambitious Artificial General Intelligencecited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms
  2. 2022Minimax Optimal Online Imitation Learning via Replay Estimation
  3. 2024Efficient Imitation Learning with Conservative World Models
  4. 2024A Bayesian Solution To The Imitation Gap
  5. 2025The Pitfalls of Imitation Learning when Actions are Continuous
  6. 2019Causal Confusion in Imitation Learning
  7. 2022Deconfounding Imitation Learning with Variational Inference
  8. 2023Action Inference by Maximising Evidence: Zero-Shot Imitation from Observation with World Models