• Aucun résultat trouvé

Approximation spaces of deep neural networks

N/A
N/A
Protected

Academic year: 2021

Partager "Approximation spaces of deep neural networks"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-02127179

https://hal.inria.fr/hal-02127179

Submitted on 13 May 2019

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Approximation spaces of deep neural networks

Rémi Gribonval, Gitta Kutyniok, Morten Nielsen, Felix Voigtlaender

To cite this version:

Rémi Gribonval, Gitta Kutyniok, Morten Nielsen, Felix Voigtlaender. Approximation spaces of deep neural networks. SMAI 2019 - 9ème Biennale des Mathématiques Appliquées et Industrielles, May 2019, Guidel, France. pp.1. �hal-02127179�

(2)

Approximation spaces of deep neural networks

R´emi Gribonval, Univ Rennes, Inria, CNRS, IRISA

Gitta Kutyniok, Institut fr Mathematik, TU Berlin

Morten Nielsen, Department of Mathematical Sciences, Aalborg University

Felix Voigtlaender, Department of Scientific Computing, KU Eichsttt

We study the expressivity of sparsely connected deep networks. Measuring a network’s complexity by its number of connections, or its number of neurons, we consider the class of functions which error of best approximation with networks of a given complexity decays at a certain rate. Using classical approximation theory, we show that this class can be endowed with a norm that makes it a nice function space, called approximation space. We establish that the presence of certain skip connections has no impact of the approximation space, and discuss the role of the network’s nonlinearity (also known as activation function) on the resulting spaces, as well as the benefits of depth. For the popular ReLU nonlinearity (as well as its powers), we relate the newly identified spaces to classical Besov spaces, which have a long history associated to sparse wavelet decompositions. The established embeddings highlight that some functions of very low Besov smoothness can nevertheless be well approximated by neural networks, if these networks are sufficiently deep.

emi Gribonval, PANAMA Research Group, Univ Rennes, Inria, CNRS, IRISA, Campus de Beaulieu, 35042 Rennes cedex, France

remi.gribonval@inria.fr

Gitta Kutyniok, Institut fr Mathematik, Technische Universitt Berlin, Strasse des 17. Juni 136, 10623 Berlin kutyniok@math.tu-berlin.de

Morten Nielsen, Department of Mathematical Sciences, Aalborg University, Skjernvej 4A, DK - 9220 Aalborg mnielsen@math.aau.dk

Felix Voigtlaender, Department of Scientific Computing, KU Eichsttt-Ingolstadt, Ostenstrasse 26, Kollegien- gebude I Bau B, 85072 Eichsttt, Germany

felix@voigtlaender.xyz

Références

Documents relatifs

The ration of the number of revolution of the driver gear to the number of revolution of the driven gear is called the gear ration.. Le rapport de réduction peut être changé

We introduce a subclass of starlike functions which extends the well-known class of alpha-convex functions (Mocanu functions) and the class of convex functions.. AMS 2000

1 Centre de Math´ematiques Appliqu´ees (CMAP), Ecole Polytechnique and CNRS, Universit´e Paris-Saclay, Route de Saclay, 91128 Palaiseau Cedex,

These functions have a simple geometric interpretation in terms of the moment map and they are real algebraic, in the sense that they are regular functions when M is regarded as a

In Section 3, we present an algorithm for the problem of minimizing the total number of communications in the UET-bound model, for the special case of a tree and an unlimited number

L’accès aux archives de la revue « Annali della Scuola Normale Superiore di Pisa, Classe di Scienze » ( http://www.sns.it/it/edizioni/riviste/annaliscienze/ ) implique l’accord

Prove that in a finite group of even order, there is an element of order 25. Show that a finite integral domain is

To evaluate numerically the average properties of the limit cycles of the networks, we randomly generate a statistically significant number of realizations of connectivity matrices