Bounds on the Approximation Power of Feedforward Neural Networks
| 
67 | 
47 | 
0
Abstract
The approximation power of general feedforward neural networks with piecewise linear activation functions is investigated. First, lower bounds on the size of a network are established in terms of the approximation error and network depth and width. These bounds improve upon stateof-the-art bounds for certain classes of functions such as strongly convex functions. Second, an upper bound is established on the difference of two neural networks with identical weights but different activation functions.
还没有评论，说两句吧！
热门资源
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
The Variational S...
Unlike traditional images which do not offer in...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Rating-Boosted La...
The performance of a recommendation system reli...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
