• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Depth-Adaptive Neural Networks from the Optimal Control viewpoint

Aghili, Joubine; Mula, Olga (2020), Depth-Adaptive Neural Networks from the Optimal Control viewpoint. https://basepub.dauphine.fr/handle/123456789/21136

View/Open
AM2020.pdf (1.440Mb)
Type
Document de travail / Working paper
External document link
https://hal.archives-ouvertes.fr/hal-02897466
Date
2020
Series title
Cahier de recherche CEREMADE
Pages
40
Metadata
Show full item record
Author(s)
Aghili, Joubine
CEntre de REcherches en MAthématiques de la DEcision [CEREMADE]
Mula, Olga cc
Laboratoire Jacques-Louis Lions [LJLL]
CEntre de REcherches en MAthématiques de la DEcision [CEREMADE]
Abstract (EN)
In recent years, deep learning has been connected with optimal control as a way to define a notion of a continuous underlying learning problem. In this view, neural networks can be interpreted as a discretization of a parametric Ordinary Differential Equation which, in the limit, defines a continuous-depth neural network. The learning task then consists in finding the best ODE parameters for the problem under consideration, and their number increases with the accuracy of the time discretization. Although important steps have been taken to realize the advantages of such continuous formulations, most current learning techniques fix a discretization (i.e. the number of layers is fixed). In this work, we propose an iterative adaptive algorithm where we progressively refine the time discretization (i.e. we increase the number of layers). Provided that certain tolerances are met across the iterations, we prove that the strategy converges to the underlying continuous problem. One salient advantage of such a shallow-to-deep approach is that it helps to benefit in practice from the higher approximation properties of deep networks by mitigating over-parametrization issues. The performance of the approach is illustrated in several numerical examples.
Subjects / Keywords
Neural Networks; Deep Learning; Continuous-Depth Neural Networks; Optimal Control

Related items

Showing items related by title and author.

  • Thumbnail
    Mean-field Langevin System, Optimal Control and Deep Neural Networks 
    Hu, Kaitong; Kazeykina, Anna; Ren, Zhenjie (2019-09) Document de travail / Working paper
  • Thumbnail
    An Adaptive Nested Source Term Iteration for Radiative Transfer Equations 
    Dahmen, Wolfgang; Gruber, Felix; Mula, Olga (2020) Article accepté pour publication ou publié
  • Thumbnail
    An Adaptive Parareal Algorithm 
    Maday, Yvon; Mula, Olga (2020) Article accepté pour publication ou publié
  • Thumbnail
    Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models 
    Binev, Peter; Cohen, Albert; Mula, Olga; Nichols, James (2018) Article accepté pour publication ou publié
  • Thumbnail
    Optimal reduced model algorithms for data-based state estimation 
    Cohen, Albert; Dahmen, Wolfgang; DeVore, Ron; Fadili, Jalal M.; Mula, Olga; Nichols, James (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo