On sample complexity of neural networks

Usvyatsov, Alexander

arXiv.org Machine Learning 

We consider functions defined by deep neural networks as definab le 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.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found