mlsanityData to 7 Oct 2026

SoftDICE for Imitation Learning: Rethinking Off-policy Distribution Matching

arXiv 2106.03155 ↗First posted 6 Jun 2021cs.LG cs.AIcited by 14

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

Abstract (arXiv)

We present SoftDICE, which achieves state-of-the-art performance for imitation learning. SoftDICE fixes several key problems in ValueDICE, an off-policy distribution matching approach for sample-efficient imitation learning. Specifically, the objective of ValueDICE contains logarithms and exponentials of expectations, for which the mini-batch gradient estimate is always biased. Second, ValueDICE regularizes the objective with replay buffer samples when expert demonstrations are limited in number, which however changes the original distribution matching problem. Third, the re-parametrization trick used to derive the off-policy objective relies on an implicit assumption that rarely holds in training. We leverage a novel formulation of distribution matching and consider an entropy-regularized off-policy objective, which yields a completely offline algorithm called SoftDICE. Our empirical results show that SoftDICE recovers the expert policy with only one demonstration trajectory and no further on-policy/off-policy samples. SoftDICE also stably outperforms ValueDICE and other baselines in terms of sample efficiency on Mujoco benchmark tasks.

Key facts. Cited by 14 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 12 of its 31 references that are in the map. First posted on arXiv 6 Jun 2021.

Builds on

12 of 31 references.

Closest ancestors · 5

Same direction, newest first

  1. 2019Imitation Learning via Off-Policy Distribution Matching10 Dec
  2. 2019A Divergence Minimization Perspective on Imitation Learning Methods6 Nov
  3. 2019Imitation Learning as f-Divergence Minimization30 May
  4. 2019Random Expert Distillation: Imitation Learning via Expert Policy Support Estimation16 May
  5. 2018Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learning9 Sep

Other references · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2017Improved Training of Wasserstein GANscited by 2,223
  4. 2016Generative Adversarial Imitation Learningcited by 1,576
  5. 2019DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Correctionscited by 254
  6. 2019Efficient Exploration via State Marginal Matchingcited by 186
  7. 2015Taming the Noise in Reinforcement Learning via Soft Updatescited by 125

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 4; 2024: 4; 2025: 0; 2026: 1.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2023Offline Imitation Learning with Suboptimal Demonstrations via Relaxed Distribution Matching
  2. 2023A Simple Solution for Offline Imitation from Observations and Examples with Possibly Incomplete Trajectories
  3. 2023Coherent Soft Imitation Learning
  4. 2022Versatile Offline Imitation from Observations and Examples via Regularized State-Occupancy Matching
  5. 2023GO-DICE: Goal-Conditioned Option-Aware Offline Imitation Learning via Stationary Distribution Correction Estimation
  6. 2022Imitation Learning by State-Only Distribution Matching
  7. 2025Learning What to Do and What Not To Do: Offline Imitation from Expert and Undesirable Demonstrations
  8. 2024Imitation Learning from Suboptimal Demonstrations via Meta-Learning An Action Ranker