Georgia Institute of Technology
Statistical and Computational Analysis of Adversarial Training
Abstract
dc:description.abstractAdversarial training is a powerful tool to hedge against data perturbations and distributional shifts, and has been widely used in large language models, computer vision, cybersecurity, etc. While the empirical risk minimization procedure optimizes the empirical loss, the adversarial training procedure seeks conservative solutions that optimize the worst-case loss. In general, there are two ways to define worst-case loss: Wasserstein-distance-based and perturbation-based. In this thesis, we present a statistical and computational analysis of adversarial training. For the Wasserstein-distance-based adversarial training problem—also known as Wasserstein distributionally robust optimization—we explore both the computational aspects of the Wasserstein distance and the statistical properties of this framework. In the case of perturbation-based adversarial training, our focus is primarily on its statistical properties. Importantly, we establish computational and statistical foundations of adversarial training, including computational complexity, convergence rates, asymptotic distributions, and minimax optimality. Building on these insights, we propose potential improvements with provable theoretical guarantees.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Industrial and Systems Engineering
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Xie, Yiling
- Advisor dc:contributor.advisor
-
- Huo, Xiaoming
- Committee members dc:contributor.committeemember
-
- Nemirovski, Arkadi
- Joseph, Roshan
- Pananjady, Ashwin
- Mao, Cheng
Subjects
dc:subject × 3Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1853/78631