Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach
arXiv:2104.04886
Abstract
Adversarial regularization has been shown to improve the generalization performance of deep learning models in various natural language processing tasks. Existing works usually formulate the method as a zero-sum game, which is solved by alternating gradient descent/ascent algorithms. Such a formulation treats the adversarial and the defending players equally, which is undesirable because only the defending player contributes to the generalization performance. To address this issue, we propose Stackelberg Adversarial Regularization (SALT), which formulates adversarial regularization as a Stackelberg game. This formulation induces a competition between a leader and a follower, where the follower generates perturbations, and the leader trains the model subject to the perturbations. Different from conventional approaches, in SALT, the leader is in an advantageous position. When the leader moves, it recognizes the strategy of the follower and takes the anticipated follower's outcomes into consideration. Such a leader's advantage enables us to improve the model fitting to the unperturbed data. The leader's strategic information is captured by the Stackelberg gradient, which is obtained using an unrolling algorithm. Our experimental results on a set of machine translation and natural language understanding tasks show that SALT outperforms existing adversarial regularization baselines across all tasks. Our code is available at https://github.com/SimiaoZuo/Stackelberg-Adv.
arXiv commentEMNLP 2021
References in corpus (11)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
- Convolutional Sequence to Sequence Learning
- On Calibration of Modern Neural Networks
- DeBERTa: Decoding-enhanced BERT with Disentangled Attention
- Unrolled Generative Adversarial Networks
- Adversarial Training for Large Neural Language Models
- Generalized Inner Loop Meta-Learning
- Improving Neural Language Modeling via Adversarial Training
- Self-supervised GAN: Analysis and Improvement with Multi-class Minimax Game
- The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization