DSpace Repository

Networks and the Best Approximation Property

Show simple item record

dc.creator Girosi, Federico
dc.creator Poggio, Tomaso
dc.date 2004-10-04T14:36:01Z
dc.date 2004-10-04T14:36:01Z
dc.date 1989-10-01
dc.date.accessioned 2013-10-09T02:42:25Z
dc.date.available 2013-10-09T02:42:25Z
dc.date.issued 2013-10-09
dc.identifier AIM-1164
dc.identifier http://hdl.handle.net/1721.1/6017
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Networks can be considered as approximation schemes. Multilayer networks of the backpropagation type can approximate arbitrarily well continuous functions (Cybenko, 1989; Funahashi, 1989; Stinchcombe and White, 1989). We prove that networks derived from regularization theory and including Radial Basis Function (Poggio and Girosi, 1989), have a similar property. From the point of view of approximation theory, however, the property of approximating continous functions arbitrarily well is not sufficient for characterizing good approximation schemes. More critical is the property of best approximation. The main result of this paper is that multilayer networks, of the type used in backpropagation, are not best approximation. For regularization networks (in particular Radial Basis Function networks) we prove existence and uniqueness of best approximation.
dc.format 22 p.
dc.format 104037 bytes
dc.format 421671 bytes
dc.format application/octet-stream
dc.format application/pdf
dc.language en_US
dc.relation AIM-1164
dc.subject learning
dc.subject networks
dc.subject regularization
dc.subject best approximation
dc.subject sapproximation theory
dc.title Networks and the Best Approximation Property


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account