On Margin Maximization in Linear and ReLU NetworksDownload PDF

Published: 31 Oct 2022, 18:00, Last Modified: 14 Dec 2022, 20:40NeurIPS 2022 AcceptReaders: Everyone
Keywords: Implicit bias, Homogeneous neural networks, Maximum margin
TL;DR: For several architectures of homogeneous neural networks involving linear and ReLU activations, we study whether gradient flow converges to a global/local optimum of the max margin problem in parameter space.
Abstract: The implicit bias of neural networks has been extensively studied in recent years. Lyu and Li (2019) showed that in homogeneous networks trained with the exponential or the logistic loss, gradient flow converges to a KKT point of the max margin problem in parameter space. However, that leaves open the question of whether this point will generally be an actual optimum of the max margin problem. In this paper, we study this question in detail, for several neural network architectures involving linear and ReLU activations. Perhaps surprisingly, we show that in many cases, the KKT point is not even a local optimum of the max margin problem. On the flip side, we identify multiple settings where a local or global optimum can be guaranteed.
Supplementary Material: pdf
11 Replies

Loading