Skip to content

DPAIL: Training Diffusion Policy for Adversarial Imitation Learning without Policy Optimization

2025 · Neural Information Processing Systems · pp. 6994-7020 · 0 citations · 37 references
Computer Science

TL;DR

DPAIL, an adversarial IL framework that leverages diffusion models as a policy class to enhance expressiveness, trains a diffusion policy using a binary cross-entropy objective to distinguish expert trajectories from generated ones to enable optimization of the diffusion policy.

Abstract

Human experts employ diverse strategies to complete a task, producing to multi-modal demonstration data. Although traditional Adversarial Imitation Learning (AIL) methods have achieved notable success, they often collapse theses multi-modal behaviors into a single strategy, failing to replicate expert behaviors. To overcome this limitation, we propose DPAIL , an adversarial IL framework that leverages diffusion models as a policy class to enhance expressiveness. Building on the Adversarial Soft Advantage Fitting (ASAF) framework, which removes the need for policy optimization steps, DPAIL trains a diffusion policy using a binary cross-entropy objective to distinguish expert trajectories from generated ones. To enable optimization of the diffusion policy, we introduce a novel, tractable lower bound on the policy’s likelihood. Through comprehensive quantitative and qualitative evaluations against various baselines, we demonstrate that our method not only captures diverse behaviors but also remains robust as the number of behavior modes increases.

View source

Similar papers

2025

Multi-Agent Imitation by Learning and Sampling from Factorized Soft Q-Function

This work proposes MAFIS, a novel method that addresses limitations for both online and offline MAIL settings by building upon the single-agent IQ-Learn framework and introducing the value decomposition network to factorize the imitation objective at agent level, thus enabling scalable training for multi-agent systems.

Yichen Li, Zhongxiang Ling, Tao Jiang et al. · 3 citations
#machine learning Preprint Sep 2026

Robust Policy Optimization via Adversarial Importance Sampling

This work introduces Adversarial Importance Sampling (Advis), a method that uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst-case returns and introduces advrl, a modular PyTorch library that provides clean, single-file implementations of existing robustness met...

Amine Andam, Jamal Bentahar, M. Hedabou · 0 citations
Sep 2026

Self-supervised multi-modal imitation learning under skewed trajectory demonstrations.

This work proposes a two-stage framework for multi-modal policy acquisition under trajectory distribution skew, and introduces a frequency-aware dynamic scaling factor that reweights mode-conditioned learning signals according to mini-batch mode frequencies, thereby increasing the contribution of underrepresented modes...

Ya-Wen Zhao, Yue Chen, Fei Zhu · 0 citations
#machine learning Preprint Aug 2026

RL-FAT: Reinforcement Learning for Fair Adversarial Training

RL-FAT is proposed, a reinforcement-learning-inspired fair adversarial training framework that uses policy-gradient based feedback from adversarial predictions to improve adversarial robustness while promoting a more balanced robustness distribution across classes.

Tejaswini Medi, Levan Mikeladze, Margret Keuper · 0 citations
Preprint Sep 2026

DIA: Denoising Intermediate Advantage for Diffusion Policy Optimization

DIA is introduced, a policy-gradient method that learns a value function over partially denoised actions and uses it to construct a denoising level advantage for each step of the generative process, enabling it to discover more effective and efficient task-level strategies and subtask sequences that baseline methods fa...

Arjun Sohal, Yuchi Zhao, Miroslav Bogdanovic et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.