Compressed imitation learning
On the map: Offline RL and imitation learning from data → Imitation learning methods
Abstract (arXiv)
In analogy to compressed sensing, which allows sample-efficient signal reconstruction given prior knowledge of its sparsity in frequency domain, we propose to utilize policy simplicity (Occam's Razor) as a prior to enable sample-efficient imitation learning. We first demonstrated the feasibility of this scheme on linear case where state-value function can be sampled directly. We also extended the scheme to scenarios where only actions are visible and scenarios where the policy is obtained from nonlinear network. The method is benchmarked against behavior cloning and results in significantly higher scores with limited expert demonstrations.
Key facts. Cited by 1 paper 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 0 of its 6 references that are in the map. First posted on arXiv 18 Sep 2020.
Builds on
0 of 6 references.
No references here yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2019Action Assembly: Sparse Imitation Learning for Text Based Games with Combinatorial Action Spaces
- 2022TaSIL: Taylor Series Imitation Learning
- 2024Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery
- 2019Reinforced Imitation in Heterogeneous Action Space
- 2021Deterministic and Discriminative Imitation (D2-Imitation): Revisiting Adversarial Imitation for Sample Efficiency
- 2023Provably Efficient Adversarial Imitation Learning with Unknown Transitions
- 2024Streaming Diffusion Policy: Fast Policy Synthesis with Variable Noise Diffusion Models
- 2020Imitating Unknown Policies via Exploration