✦ LIBER ✦

Dimension-independent bounds on the degree of approximation by neural networks

✍ Scribed by H. N. Mhaskar; C. A. Micchelli

Book ID: 126694552
Publisher: IBM
Year: 1994
Tongue: English
Weight: 510 KB
Volume: 38
Category: Article
ISSN: 0018-8646
DOI: 10.1147/rd.383.0277

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Degree of Approximation by Manifo

On the Degree of Approximation by Manifolds of Finite Pseudo-Dimension

✍ V. Maiorov; J. Ratsaby 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 147 KB

Bounds on rates of variable-basis and ne

Bounds on rates of variable-basis and neural-network approximation

✍ Kurkova, V.; Sanguineti, M. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 220 KB

On the approximation by neural networks

On the approximation by neural networks with bounded number of neurons in hidden layers

✍ Ismailov, Vugar E. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Degree of Approximation by Neural and Tr

Degree of Approximation by Neural and Translation Networks with a Single Hidden Layer

✍ H.N. Mhaskar; C.A. Micchelli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 921 KB

On the approximation of stochastic proce

On the approximation of stochastic processes by approximate identity neural networks

✍ Turchetti, C.; Conti, M.; Crippa, P.; Orcioni, S. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 785 KB

On the dimensions of ordered sets of bou

On the dimensions of ordered sets of bounded degree

✍ Z. Füredi; J. Kahn 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 289 KB

Here it is proven that there exists a constant c (c < 50) such that dim P < ck(log k) \*. This improves an earlier result of Rod1 and Trotter (dim P < 2k' + 2). Our proof is nonconstructive, depending in part on LOW&Z local lemma. AMS (MOS) subject classification (1980). 06AlO.