|
|
||||||||
Note |
School of Information Systems, University of East Anglia, Norwich, U.K.
Signal Processing Section, Department of Electrical and Electronic Engineering, Imperial College of Science, Technology and Medicine, London, U.K.
The lower bounds for the a posteriori prediction error of a nonlinear predictor realized as a neural network are provided. These are obtained for a priori adaptation and a posteriori error networks with sigmoid nonlinearities trained by gradient-descent learning algorithms. A contractivity condition is imposed on a nonlinear activation function of a neuron so that the a posteriori prediction error is smaller in magnitude than the corresponding a priori one. Furthermore, an upper bound is imposed on the learning rate
so that the approach is feasible. The analysis is undertaken for both feedforward and recurrent nonlinear predictors realized as neural networks.
This article has been cited by other articles:
![]() |
M. Pedzisz and D. P. Mandic A Homomorphic Neural Network for Modeling and Prediction Neural Comput., April 1, 2007; 20(4): 1042 - 1064. [Abstract] [Full Text] [PDF] |
||||
![]() |
D. P. Mandic Data-Reusing Recurrent Neural Adaptive Filters Neural Comput., November 1, 2002; 14(11): 2693 - 2707. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |