Skip Navigation

IMA Journal of Management Mathematics 1999 10(3):225-244; doi:10.1093/imaman/10.3.225
© 1999 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by MALCOLM, B.
Right arrow Articles by MORGAN, P.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Neural networks and finite-order approximations

BEYNON MALCOLM, CURRY BRUCE{dagger} and PETER MORGAN

Cardiff Business School, University of Wales Cardiff Colum Drive, Cardiff CF1 3EU, UK

Email: Curry{at}Cardiff.ac.uk

This paper investigates the approximation properties of standard feedforward neural networks (NNs) through the application of multivanate Thylor-series expansions. The capacity to approximate arbitrary functional forms is central to the NN philosophy, but is usually proved by allowing the number of hidden nodes to increase to infinity. The Thylor-series approach does not depend on such limiting cases, lie paper shows how the series approximation depends on individual network weights. The role of the bias term is taken as an example. We are also able to compare the sigmoid and hyperbolic-tangent activation functions, with particular emphasis on their impact on the bias term. The paper concludes by discussing the potential importance of our results for NN modelling: of particular importance is the training process.

Keywords: Neural network; feedforward logistic networks; Thylor series; activation function; bias term


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.