Overview
Field: Machine Learning Authors: Yi Feng, Andrea Paudice Published: 2026-11-05 arXiv: 2611.08457
Adversarial Training (AT) is an important method for improving model robustness. This paper studies the dynamics of deterministic Gradient Descent (GD) in AT. Most existing works in this direction focus on the small or vanishing step sizes regime, where GD resembles a continuous-time flow. However, such step sizes can make training inefficient and are rarely used in practice. This work instead studies the AT dynamics of GD with large constant step sizes.
The authors first analyze GD in adversarial linear logistic regression, focusing on two aspects: where the model parameters converge (implicit bias) and how quickly the losses decrease (optimization). They then turn to neural network training and study how the sharpness of the loss evolves during AT.
Key Findings
Compared to standard training (ST), the paper highlights three key differences:
- Implicit bias gap persists: The implicit bias difference between AT and ST, previously established only in the small-step-size regime, still holds for arbitrarily large constant step sizes.
- No unified convergence rate: Unlike ST, the optimization error in AT does not admit a unified convergence rate.
- Two-phase sharpness dynamics: Sharpness can exhibit two-phase dynamics that differ from the Edge-of-Stability behavior observed in ST.
---
*Auto-collected on 2026-11-07*