| Автор | Ellacott, S.W. |
| Дата выпуска | 1994 |
| dc.description | This article starts with a brief introduction to neural networks for those unfamiliar with the basic concepts, together with a very brief overview of mathematical approaches to the subject. This is followed by a more detailed look at three areas of research which are of particular interest to numerical analysts.The first area is approximation theory. If K is a compact set in ℝ<sup>n</sup>, for some n, then it is proved that a semilinear feedforward network with one hidden layer can uniformly approximate any continuous function in C(K) to any required accuracy. A discussion of known results and open questions on the degree of approximation is included. We also consider the relevance of radial basis functions to neural networks.The second area considered is that of learning algorithms. A detailed analysis of one popular algorithm (the delta rule) will be given, indicating why one implementation leads to a stable numerical process, whereas an initially attractive variant (essentially a form of steepest descent) does not. Similar considerations apply to the backpropagation algorithm. The effect of filtering and other preprocessing of the input data will also be discussed systematically.Finally some applications of neural networks to numerical computation are considered. |
| Формат | application.pdf |
| Издатель | Cambridge University Press |
| Копирайт | Copyright © Cambridge University Press 1994 |
| Название | Aspects of the numerical analysis of neural networks |
| Тип | research-article |
| DOI | 10.1017/S0962492900002439 |
| Electronic ISSN | 1474-0508 |
| Print ISSN | 0962-4929 |
| Журнал | Acta Numerica |
| Том | 3 |
| Первая страница | 145 |
| Последняя страница | 202 |
| Аффилиация | Ellacott S.W.; University of Brighton Moulsecoomb |
