Papers › Planning for Sample Efficient Imitation Learning

Planning for Sample Efficient Imitation Learning

18 Oct 2022arXiv:2210.09598archive 2025-07-28

Zhao-Heng Yin, Weirui Ye, Qifeng Chen, Yang Gao

Imitation learning is a class of promising policy learning algorithms that is free from many practical issues with reinforcement learning, such as the reward design issue and the exploration hardness. However, the current imitation algorithm struggles to achieve both high performance and high in-environment sample efficiency simultaneously. Behavioral Cloning (BC) does not need in-environment interactions, but it suffers from the covariate shift problem which harms its performance. Adversarial Imitation Learning (AIL) turns imitation learning into a distribution matching problem. It can achieve better performance on some tasks but it requires a large number of in-environment interactions. Inspired by the recent success of EfficientZero in RL, we propose EfficientImitate (EI), a planning-based imitation learning method that can achieve high in-environment sample efficiency and performance simultaneously. Our algorithmic contribution in this paper is two-fold. First, we extend AIL into the MCTS-based RL. Second, we show the seemingly incompatible two classes of imitation algorithms (BC and AIL) can be naturally unified under our framework, enjoying the benefits of both. We benchmark our method not only on the state-based DeepMind Control Suite, but also on the image version which many previous works find highly challenging. Experimental results show that EI achieves state-of-the-art results in performance and sample efficiency. EI shows over 4x gain in performance in the limited sample setting on state-based and image-based tasks and can solve challenging problems like Humanoid, where previous methods fail with small amount of interactions. Our code is available at https://github.com/zhaohengyin/EfficientImitate.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2210.09598")

Code

Syntology Ran 8 of 10 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · honoured contract; 2 ran · our draft was wrong; 1 ran · fixture could not drive it; 4 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zhaohengyin/EfficientImitate officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 8 ran; 1 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
1ran · fixture could not drive it
4ran
2unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zhaohengyin/EfficientImitate. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

ActorCriticNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 89159fd394eef8da · report
PredNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · metamorphic tier: deterministic MIT (permissive) · d69e09cf8b1b9c27 · report
RepresentationNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · metamorphic tier: deterministic MIT (permissive) · 09ca94f5f2b3ffda · report
RewardNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · metamorphic tier: deterministic MIT (permissive) · cacbaaa63c29f934 · report
dict_to_cpu zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · our draft was wrong MIT (permissive) · 88b04eafd87435f2 · report
mlp zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · fixture could not drive it MIT (permissive) · 4c8aa25db20d758e · report
support_to_scalar zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 8a376431bfa31f3a · report
tensor_to_numpy zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository ran · honoured contract MIT (permissive) · 255167c323c80d7b · report
AbstractNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository unverified MIT (permissive) · a2ab73a0251612a4 · report
MuZeroResidualNetwork zhaohengyin/EfficientImitate/algo/obs_ei/model.py official repository unverified MIT (permissive) · 184612793da7dac1 · report

Tasks

Imitation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections