IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i1p120-152.html
   My bibliography  Save this article

Mean Field Analysis of Deep Neural Networks

Author

Listed:
  • Justin Sirignano

    (Mathematical Institute, University of Oxford, Oxford OX2 6GG, United Kingdom)

  • Konstantinos Spiliopoulos

    (Department of Mathematics and Statistics, Boston University, Boston, Massachusetts 02215)

Abstract

We analyze multilayer neural networks in the asymptotic regime of simultaneously (a) large network sizes and (b) large numbers of stochastic gradient descent training iterations. We rigorously establish the limiting behavior of the multilayer neural network output. The limit procedure is valid for any number of hidden layers, and it naturally also describes the limiting behavior of the training loss. The ideas that we explore are to (a) take the limits of each hidden layer sequentially and (b) characterize the evolution of parameters in terms of their initialization. The limit satisfies a system of deterministic integro-differential equations. The proof uses methods from weak convergence and stochastic analysis. We show that, under suitable assumptions on the activation functions and the behavior for large times, the limit neural network recovers a global minimum (with zero loss for the objective function).

Suggested Citation

  • Justin Sirignano & Konstantinos Spiliopoulos, 2022. "Mean Field Analysis of Deep Neural Networks," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 120-152, February.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:1:p:120-152
    DOI: 10.1287/moor.2020.1118
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2020.1118
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2020.1118?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:47:y:2022:i:1:p:120-152. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.