Neural Network Approximation of Refinable Functions.

Daubechies, Ingrid

DeVore, Ronald

Dym, Nadav

Faigenbaum-Golovin, Shira

Kovalsky, Shahar Z

Lin, Kung-Ching

Park, Josiah

Petrova, Guergana

Sober, Barak

2021-12-17T04:29:18Z

2021-12-17T04:29:18Z

2021

2021-12-17T04:29:18Z

In the desire to quantify the success of neural networks in deep learning and other applications, there is a great interest in understanding which functions are efficiently approximated by the outputs of neural networks. By now, there exists a variety of results which show that a wide range of functions can be approximated with sometimes surprising accuracy by these outputs. For example, it is known that the set of functions that can be approximated with exponential accuracy (in terms of the number of parameters used) includes, on one hand, very smooth functions such as polynomials and analytic functions (see e.g. \cite{E,S,Y}) and, on the other hand, very rough functions such as the Weierstrass function (see e.g. \cite{EPGB,DDFHP}), which is nowhere differentiable. In this paper, we add to the latter class of rough functions by showing that it also includes refinable functions. Namely, we show that refinable functions are approximated by the outputs of deep ReLU networks with a fixed width and increasing depth with accuracy exponential in terms of their number of parameters. Our results apply to functions used in the standard construction of wavelets as well as to functions constructed via subdivision algorithms in Computer Aided Geometric Design.

https://hdl.handle.net/10161/24082

CoRR

cs.LG

cs.LG

Neural Network Approximation of Refinable Functions.

Journal article

Sober, Barak|0000-0001-5090-5551

Faculty

Duke

Trinity College of Arts & Sciences

Mathematics

abs/2107.13191