mlsanityData to 14 Oct 2026

On the Benefits of Inducing Local Lipschitzness for Robust Generative Adversarial Imitation Learning

arXiv 2107.00116 ↗First posted 30 Jun 2021cs.LGcited by 2

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

Abstract (arXiv)

We explore methodologies to improve the robustness of generative adversarial imitation learning (GAIL) algorithms to observation noise. Towards this objective, we study the effect of local Lipschitzness of the discriminator and the generator on the robustness of policies learned by GAIL. In many robotics applications, the learned policies by GAIL typically suffer from a degraded performance at test time since the observations from the environment might be corrupted by noise. Hence, robustifying the learned policies against the observation noise is of critical importance. To this end, we propose a regularization method to induce local Lipschitzness in the generator and the discriminator of adversarial imitation learning methods. We show that the modified objective leads to learning significantly more robust policies. Moreover, we demonstrate -- both theoretically and experimentally -- that training a locally Lipschitz discriminator leads to a locally Lipschitz generator, thereby improving the robustness of the resultant policy. We perform extensive experiments on simulated robot locomotion environments from the MuJoCo suite that demonstrate the proposed method learns policies that significantly outperform the state-of-the-art generative adversarial imitation learning algorithm when applied to test scenarios with noise-corrupted observations.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Imitation learning methods, one of 13 directions in Offline RL and imitation learning from data. Builds on 17 of its 29 references that are in the map. First posted on arXiv 30 Jun 2021.

Builds on

17 of 29 references.

Closest ancestors · 4

Same direction, newest first

  1. 2021What Matters for Adversarial Imitation Learning?1 Jun
  2. 2020Lipschitzness Is All You Need To Tame Off-policy Generative Adversarial Imitation Learning28 Jun
  3. 2019Better-than-Demonstrator Imitation Learning via Automatically-Ranked Demonstrations9 Jul
  4. 2019Wasserstein Adversarial Imitation Learning19 Jun

Other references · 13

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Trust Region Policy Optimizationcited by 2,580
  3. 2017Improved Training of Wasserstein GANscited by 2,235
  4. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
  5. 2016Generative Adversarial Imitation Learningcited by 1,597
  6. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  7. 2017Learning Robust Rewards with Adversarial Inverse Reinforcement Learningcited by 490
  8. 2017Robust Adversarial Reinforcement Learningcited by 451
  9. 2019Extrapolating Beyond Suboptimal Demonstrations via Inverse Reinforcement Learning from Observationscited by 260
  10. 2021Self-Supervised Online Reward Shaping in Sparse-Reward Environmentscited by 37
  11. 2017Loss-Sensitive Generative Adversarial Networks on Lipschitz Densitiescited by 29
  12. 2020Active Task-Inference-Guided Deep Inverse Reinforcement Learningcited by 17
1 more
  1. 2021Variational Empowerment as Representation Learning for Goal-Based Reinforcement Learningcited by 15

Built on by

Cited by year

Citing papers per year: 2022: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Robust Behavior Cloning Via Global Lipschitz Regularization
  2. 2023Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective
  3. 2018Risk-Sensitive Generative Adversarial Imitation Learning
  4. 2022Robust Learning from Observation with Model Misspecification
  5. 2020On Computation and Generalization of Generative Adversarial Imitation Learning
  6. 2020f-GAIL: Learning f-Divergence for Generative Adversarial Imitation Learning
  7. 2021Domain-Robust Visual Imitation Learning with Mutual Information Constraints
  8. 2018Sample-Efficient Imitation Learning via Generative Adversarial Nets