The Implicit Bias of Adam on Separable Data

Adam has become one of the most favored optimizers in deep learning problems. Despite its success in practice, numerous mysteries persist regarding its theoretical understanding. In this paper, we study the implicit bias of Adam in linear logistic regression. Specifically, we show that when the training data are linearly separable, the iterates of Adam converge towards a linear classifier that achieves the maximum \ell_\infty -margin in direction. Notably, for a general class of diminishing learning rates, this convergence occurs within polynomial time.