next up previous
Next: Introduction

An Analytical Framework for Local Feedforward Networks

Scott Weaver tex2html_wrap_inline1202 , Leemon Baird tex2html_wrap_inline1204 , Marios Polycarpou tex2html_wrap_inline1206



tex2html_wrap_inline1208 Department of Electrical and Computer Engineering
University of Cincinnati
Cincinnati, Ohio 45221-0030
Email: scott.weaver@uc.edu

tex2html_wrap_inline1210 Wright-Patterson Air Force Base
WL/AAAT Bldg 635
2185 Avionics Circle
WPAFB, OH 45433-7301

tex2html_wrap_inline1212 United States Air Force Academy
HQ USAFA/DFCS
2354 Fairchild Dr. Suite 6K41
USAFA, CO 80840-6234

Abstract:

Although feedforward neural networks are well suited to function approximation, in some applications networks experience problems when learning a desired function. One problem is interference which occurs when learning in one area of the input space causes unlearning in another area. Networks that are less susceptible to interference are referred to as spatially local networks. To understand these properties, a theoretical framework, consisting of a measure of interference and a measure of network localization, is developed that incorporates not only the network weights and architecture but also the learning algorithm. Using this framework to analyze sigmoidal multi-layer perceptron (MLP) networks that employ the back-prop learning algorithm, we address a familiar misconception that sigmoidal networks are inherently non-local by demonstrating that given a sufficiently large number of adjustable parameters, sigmoidal MLPs can be made arbitrarily local while retaining the ability to represent any continuous function on a compact domain.





Leemon Baird
Fri Jan 15 02:27:28 EST 1999