{
  "id": "2002.04710",
  "version": "v1",
  "published": "2020-02-11T22:01:19.000Z",
  "updated": "2020-02-11T22:01:19.000Z",
  "title": "Unique Properties of Wide Minima in Deep Networks",
  "authors": [
    "Rotem Mulayoff",
    "Tomer Michaeli"
  ],
  "categories": [
    "cs.LG",
    "stat.ML"
  ],
  "abstract": "It is well known that (stochastic) gradient descent has an implicit bias towards wide minima. In deep neural network training, this mechanism serves to screen out minima. However, the precise effect that this has on the trained network is not yet fully understood. In this paper, we characterize the wide minima in linear neural networks trained with a quadratic loss. First, we show that linear ResNets with zero initialization necessarily converge to the widest of all minima. We then prove that these minima correspond to nearly balanced networks whereby the gain from the input to any intermediate representation does not change drastically from one layer to the next. Finally, we show that consecutive layers in wide minima solutions are coupled. That is, one of the left singular vectors of each weight matrix, equals one of the right singular vectors of the next matrix. This forms a distinct path from input to output, that, as we show, is dedicated to the signal that experiences the largest gain end-to-end. Experiments indicate that these properties are characteristic of both linear and nonlinear models trained in practice.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-02-11T22:01:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "deep networks",
      "unique properties",
      "left singular vectors",
      "wide minima solutions",
      "largest gain end-to-end"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}