Difference-Aware Retrieval Policies for Imitation Learning

Quinn Pfeifer, Ethan Pronovost, Paarth Shah, Khimya Khetarpal, Siddhartha Srinivasa +1 more
6/8/2026
cs.ROcs.AIcs.LG

No official code found. Best implementation: WEIRDLabUW/darp (7 stars, last commit 2026-06-08).

Abstract

Parametric imitation learning via behavior cloning can suffer from poor generalization to out-of-distribution states due to compounding errors during deployment. We show that reusing the training data during inference via a semi-parametric retrieval-based imitation learning approach can alleviate this challenge. We present Difference-Aware Retrieval Policies for Imitation Learning (DARP), a semi-parametric retrieval-based imitation learning approach that addresses this limitation by reparameterizing the imitation learning problem in terms of local neighborhood structure rather than direct state-to-action mappings. Instead of learning a global policy, DARP trains a model to predict actions based on $k$-nearest neighbors from expert demonstrations, their corresponding actions, and the relative distance vectors between neighbor states and query states. DARP requires no additional assumptions beyond those made for standard behavior cloning -- it does not require additional data collection, online expert feedback, or task-specific knowledge. We demonstrate consistent performance improvements of 15-46% over standard behavior cloning across diverse domains, including continuous control and robotic manipulation, and across different representations, including high-dimensional visual features. Code and demos are available at https://weirdlabuw.github.io/darp-site/.

View on arXivView PDF

Code Implementations(1)

WEIRDLabUW/darpCommunity66%

Official codebase for the ICLR 2026 paper Difference-Aware Retrieval Policies for Imitation Learning

70Jan 27, 20264 months ago

Cite this paper

@article{pfeifer2026differenceaware,
  title  = {Difference-Aware Retrieval Policies for Imitation Learning},
  author = {Quinn Pfeifer and Ethan Pronovost and Paarth Shah and Khimya Khetarpal and Siddhartha Srinivasa and Abhishek Gupta},
  year   = {2026},
  eprint = {2606.09758},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.09758v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.09758.svg)](https://codeofpaper.com/paper/2606.09758)

Discussion