**Boris Hanin**

Department of Mathematics, Texas A&M, College Station, TX 77843, USA; bhanin@math .tamu.edu

Received: 29 September 2019; Accepted: 16 October 2019; Published: 18 October 2019

**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 *<sup>w</sup>*min(*d*) so that ReLU nets of width *<sup>w</sup>*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.

**Keywords:** Deep Neural Nets; ReLU Networks; Approximation Theory
