𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Continuity of Approximation by Neural Networks in LpSpaces

✍ Scribed by Paul C. Kainen; Věra Kůrková; Andrew Vogt

Book ID
110295574
Publisher
Springer US
Year
2001
Tongue
English
Weight
64 KB
Volume
101
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniform Approximation by Neural Networks
Uniform Approximation by Neural Networks
✍ Y. Makovoz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Let D/R d be a compact set and let 8 be a uniformly bounded set of D Ä R functions. For a given real-valued function f defined on D and a given natural number n, we are looking for a good uniform approximation to f of the form n i=1 a i , i , with , i # 8, a i # R. Two main cases are considered: (1)

On the approximate realization of contin
On the approximate realization of continuous mappings by neural networks
✍ Ken-Ichi Funahashi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 733 KB

In this paper, we prove that any continuous mapping can be approximately realized by Rumelhart-Hinton-Williams' multilayer neural networks with at least one hidden layer whose output functions are sigmoid functions. The starting point of the proof for the one hidden layer case is an integral formula

Approximation of dynamical systems by co
Approximation of dynamical systems by continuous time recurrent neural networks
✍ Ken-ichi Funahashi; Yuichi Nakamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 431 KB

In this paper, we prove that any finite time trajectory of a given n-dimensional dynamical system can be approximately realized by the internal state of the output units of a continuous time recurrent neural network with n output units, some hidden units, and an appropriate initial condition. The es

Neural network approximation of continuo
Neural network approximation of continuous functionals and continuous functions on compactifications
✍ M.B. Stinchcombe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 164 KB

This article characterizes the set of activation functions, bounded or unbounded, that allow feedforward network approximation of the continuous functions on the classic two-point compactification of R 1 . The characterization fails when the set of targets are continuous functions on the classic com

Universal approximation in p-mean by neu
Universal approximation in p-mean by neural networks
✍ Robert M. Burton; Herold G. Dehling 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 112 KB

A feedforward neural net with d input neurons and with a single hidden layer of n neurons is given by where a j , v j , w ji ʦ R. In this paper we study the approximation of arbitrary functions f: R d → R by a neural net in an L p (m) norm for some finite measure m on R d . We prove that under natu