Sciweavers

4 search results - page 1 / 1
» Geometric Interpretation of Nonlinear Approximation Capabili...
Sort
View
ISNN
2004
Springer
13 years 10 months ago
Geometric Interpretation of Nonlinear Approximation Capability for Feedforward Neural Networks
This paper presents a preliminary study on the nonlinear approximation capability of feedforward neural networks (FNNs) via a geometric approach. Three simplest FNNs with at most f...
Bao-Gang Hu, Hong-Jie Xing, Yujiu Yang
NC
1998
101views Neural Networks» more  NC 1998»
13 years 6 months ago
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
Günther R. Raidl, Gabriele Kodydek
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ECCC
2000
158views more  ECCC 2000»
13 years 4 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass