paper-with-me

홈 › Papers

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

2020-06-28 · Lionel Blondé, Pablo Strasser, Alexandros Kalousis

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.

📄 PDF Abstract BibTeX arXiv:2006.16785

Code (1)

lionelblonde/liayn-pytorch 공식 구현 pytorch

Tasks

AllContinuous ControlImitation Learningvalid

Similar Papers 제목 키워드 기반

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

2021-06-30 · Farzan Memarian, Abolfazl Hashemi, Scott Niekum, Ufuk Topcu

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 discrimina…

Imitation LearningMuJoCo

TAME: Test-Time Adversarial Prompt Tuning via Mixture-of-Experts for Vision-Language Models

2026-05-17 · Xin Wang, Yixu Wang, Jiaming Zhang, Ruofan Wang 외 arxiv

Large-scale pre-trained Vision-Language models (VLMs), such as CLIP, exhibit strong zero-shot generalization, yet remain highly vulnerable to imperceptible adversarial perturbations, raising serious safety concerns for o…

Zero-shot GeneralizationAdversarial Robustness

Diffusion Models are Certifiably Robust Classifiers

2024-02-04 · Huanran Chen, Yinpeng Dong, Shitong Shao, Zhongkai Hao 외

Generative learning, recognized for its effective modeling of data distributions, offers inherent advantages in handling out-of-distribution instances, especially for enhancing robustness to adversarial attacks. Among th…

Robust classification

Attacking Adversarial Attacks as A Defense

2021-06-09 · Boxi Wu, Heng Pan, Li Shen, Jindong Gu 외

It is well known that adversarial attacks can fool deep neural networks with imperceptible perturbations. Although adversarial training significantly improves model robustness, failure cases of defense still broadly exis…

Unsupervised Adaptive Semantic Segmentation with Local Lipschitz Constraint

2021-05-27 · Guanyu Cai, Lianghua He

Recent advances in unsupervised domain adaptation have seen considerable progress in semantic segmentation. Existing methods either align different domains with adversarial training or involve the self-learning that util…

Domain AdaptationSegmentationSelf-LearningSemantic Segmentation+1