On sample complexity of neural networks

10/24/2019

∙

by   Alexander Usvyatsov, et al.

∙

0

∙

share

We consider functions defined by deep neural networks as definable objects in an o-miminal expansion of the real field, and derive an almost linear (in the number of weights) bound on sample complexity of such networks.