Paper Info
Title
Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activations
Abstract
This article concerns the expressive power of depth in neural nets with ReLU activations and a bounded width. We are particularly interested in the following questions: What is the minimal width w(min) (d) so that ReLU nets of width w(min) (d) (and arbitrary depth) can approximate any continuous function on the unit cube [0, 1](d) arbitrarily well? For ReLU nets near this minimal width, what can one say about the depth necessary to approximate a given function? We obtain an essentially complete answer to these questions for convex functions. Our approach is based on the observation that, due to the convexity of the ReLU activation, ReLU nets are particularly well suited to represent convex functions. In particular, we prove that ReLU nets with width d + 1 can approximate any continuous convex function of d variables arbitrarily well. These results then give quantitative depth estimates for the rate of approximation of any continuous scalar function on the d-dimensional cube [0, 1](d) by ReLU nets with width d + 3.
Year
DOI
Venue
2017
10.3390/math7100992
MATHEMATICS
Keywords
Field
DocType
Deep Neural Nets,ReLU Networks,Approximation Theory
Discrete mathematics,Continuous function,Combinatorics,Mathematical optimization,Convexity,Function approximation,Convex function,Unit cube,Scalar field,Mathematics,Cube,Bounded function
Journal
Volume
Issue
ISSN
7
10
Mathematics 2019, 7(10), 992
Citations 
PageRank 
References 
15
0.62
9
Authors
1
Name
Order
Citations
PageRank
Boris Hanin1474.04