arXiv Analytics

Sign in

arXiv:1710.09412 [cs.LG]AbstractReferencesReviewsResources

mixup: Beyond Empirical Risk Minimization

Hongyi Zhang, Moustapha Cisse, Yann N. Dauphin, David Lopez-Paz

Published 2017-10-25Version 1

Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their labels. By doing so, mixup regularizes the neural network to favor simple linear behavior in-between training examples. Our experiments on the ImageNet-2012, CIFAR-10, CIFAR-100, Google commands and UCI datasets show that mixup improves the generalization of state-of-the-art neural network architectures. We also find that mixup reduces the memorization of corrupt labels, increases the robustness to adversarial examples, and stabilizes the training of generative adversarial networks.

Related articles: Most relevant | Search more
arXiv:1807.09705 [cs.LG] (Published 2018-07-25)
Limitations of the Lipschitz constant as a defense against adversarial examples
arXiv:1902.10660 [cs.LG] (Published 2019-02-27)
Robust Decision Trees Against Adversarial Examples
arXiv:2003.09372 [cs.LG] (Published 2020-03-20)
One Neuron to Fool Them All