Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Leshno, Moshe | - |
dc.contributor.author | Lin, Valdimir Ya. | - |
dc.contributor.author | Pinkus, Allan | - |
dc.contributor.author | Schocken, Shimon | - |
dc.date.accessioned | 2006-02-08T14:40:46Z | - |
dc.date.available | 2006-02-08T14:40:46Z | - |
dc.date.issued | 1992-03 | - |
dc.identifier.uri | http://hdl.handle.net/2451/14329 | - |
dc.description.abstract | Several researchers characterized the activation function under which multilayer feedforward networks can act as universal approximators. We show that most of all the characterizations that were reported thus far in the literature are special cases of the following general result: a standard multilayer feedforward network with a locally bounded piecewise continuous activation function can approximate any continuous function to any degree of accuracy if and only if the network's activation function is not a polynomial. We also emphasize the important role of the threshold, asserting that without it the last theorem does not hold. | en |
dc.format.extent | 2770620 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | English | EN |
dc.language.iso | en_US | - |
dc.publisher | Stern School of Business, New York University | en |
dc.relation.ispartofseries | IS-92-13 | - |
dc.subject | Multilayer feedforward networks | en |
dc.subject | Activation functions | en |
dc.subject | role of threshold | en |
dc.subject | Universal approximation capabilities | en |
dc.subject | LP(μ) approximation | en |
dc.title | MULTILAYER FEEDFORWARD NETWORKS WITH A NON-POLYNOMIAL ACTIVATION FUNCTION CAN APPROXIMATE ANY FUNCTION | en |
dc.type | Working Paper | en |
dc.description.series | Information Systems Working Papers Series | EN |
Appears in Collections: | IOMS: Information Systems Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IS-92-13.pdf | 2.71 MB | Adobe PDF | View/Open |
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.