LGCLApr 11, 2021

Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach

arXiv:2104.04886v3665 citationsHas Code
Originality Incremental advance
AI Analysis

This work addresses a problem in natural language processing by providing a more effective adversarial regularization method, though it is incremental as it builds on existing game-theoretic approaches.

The paper tackled the issue of adversarial regularization in deep learning by reformulating it as a Stackelberg game, where the leader (defending player) has an advantage, leading to improved generalization performance in machine translation and natural language understanding tasks, outperforming existing baselines across all tasks.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes