mlsanityData to 7 Oct 2026

Lipschitzness Is All You Need To Tame Off-policy Generative Adversarial Imitation Learning

arXiv 2006.16785 ↗First posted 28 Jun 2020cs.LG cs.AIcited by 15

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

Abstract (arXiv)

Despite the recent success of reinforcement learning in various domains, these approaches remain, for the most part, deterringly sensitive to hyper-parameters and are often riddled with essential engineering feats allowing their success. We consider the case of off-policy generative adversarial imitation learning, and perform an in-depth review, qualitative and quantitative, of the method. We show that forcing the learned reward function to be local Lipschitz-continuous is a sine qua non condition for the method to perform well. We then study the effects of this necessary condition and provide several theoretical results involving the local Lipschitzness of the state-value function. We complement these guarantees with empirical evidence attesting to the strong positive effect that the consistent satisfaction of the Lipschitzness constraint on the reward has on imitation performance. Finally, we tackle a generic pessimistic reward preconditioning add-on spawning a large class of reward shaping methods, which makes the base method it is plugged into provably more robust, as shown in several additional theoretical guarantees. We then discuss these through a fine-grained lens and share our insights. Crucially, the guarantees derived and reported in this work are valid for any reward satisfying the Lipschitzness condition, nothing is specific to imitation. As such, these may be of independent interest.

Key facts. Cited by 15 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 80 of its 158 references that are in the map. First posted on arXiv 28 Jun 2020.

Builds on

80 of 158 references.

Closest ancestors · 5

Same direction, newest first

  1. 2019Task-Relevant Adversarial Imitation Learning2 Oct
  2. 2019Random Expert Distillation: Imitation Learning via Expert Policy Support Estimation16 May
  3. 2018Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow1 Oct
  4. 2018Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learning9 Sep
  5. 2018Sample-Efficient Imitation Learning via Generative Adversarial Nets6 Sep

Other references · 75

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2017Proximal Policy Optimization Algorithmscited by 14,441
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  5. 2016Layer Normalizationcited by 5,579
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  7. 2015Continuous control with deep reinforcement learningcited by 3,279
  8. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  9. 2015Trust Region Policy Optimizationcited by 2,503
  10. 2019Scalability in Perception for Autonomous Driving: Waymo Open Datasetcited by 2,436
  11. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  12. 2017Improved Training of Wasserstein GANscited by 2,223
38 more
  1. 2017Decoupled Weight Decay Regularizationcited by 1,722
  2. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  3. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  4. 2016Generative Adversarial Imitation Learningcited by 1,576
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  6. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  7. 2015Unsupervised Visual Representation Learning by Context Predictioncited by 1,062
  8. 2019When Does Label Smoothing Help?cited by 985
  9. 2018Exploration by Random Network Distillationcited by 966
  10. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  11. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  12. 2019Solving Rubik's Cube with a Robot Handcited by 699
  13. 2018Which Training Methods for GANs do actually Converge?cited by 672
  14. 2017Wasserstein GANcited by 635
  15. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  16. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  17. 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
  18. 2015Policy Distillationcited by 414
  19. 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
  20. 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 311
  21. 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
  22. 2016NIPS 2016 Tutorial: Generative Adversarial Networkscited by 284
  23. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
  24. 2017Noisy Networks for Explorationcited by 262
  25. 2017One-Shot Imitation Learningcited by 232
  26. 2016Learning to Navigate in Complex Environmentscited by 192
  27. 2016Sample Efficient Actor-Critic with Experience Replaycited by 185
  28. 2018Deep Reinforcement Learning and the Deadly Triadcited by 170
  29. 2017Parameter Space Noise for Explorationcited by 158
  30. 2016Energy-based Generative Adversarial Networkcited by 119
  31. 2017Stabilizing Training of Generative Adversarial Networks through Regularizationcited by 118
  32. 2020Learning to Walk in the Real World with Minimal Human Effortcited by 103
  33. 2018Adapting Auxiliary Losses Using Gradient Similaritycited by 98
  34. 2017Robust Imitation of Diverse Behaviorscited by 85
  35. 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 84
  36. 2016Learning values across many orders of magnitudecited by 80
  37. 2019Diagnosing Bottlenecks in Deep Q-learning Algorithmscited by 73
  38. 2016Loss is its own Reward: Self-Supervision for Reinforcement Learningcited by 72

50 most cited of 75 All 75 (JSON)

Built on by

Cited by year

Citing papers per year: 2021: 7; 2022: 0; 2023: 3; 2024: 3; 2025: 2.

15 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2020On Computation and Generalization of Generative Adversarial Imitation Learning
  2. 2020Shaping Rewards for Reinforcement Learning with Imperfect Demonstrations using Generative Models
  3. 2024Provably Efficient Off-Policy Adversarial Imitation Learning with Convergence Guarantees
  4. 2025Enabling Off-Policy Imitation Learning with Deep Actor Critic Stabilization
  5. 2023Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective
  6. 2025Robust Behavior Cloning Via Global Lipschitz Regularization
  7. 2026Provably Efficient Policy-Reward Co-Pretraining for Adversarial Imitation Learning
  8. 2026Adversarial Imitation Learning with General Function Approximation: Theoretical Analysis and Practical Algorithms