Encyclopedia > Neural network

  Article Content

Neural network

An artificial neural network, more commonly known as a neural network or neural net for short, is a computer system based on a connectionist approach to computation. Simple nodes (or "neurons", or "units") are connected together to form a network of nodes - hence the term "neural network". The original inspiration for the technique was from examination of bioelectrical networks in the brain formed by neurons and their synapses.

Most researchers today would agree that artificial neural networks are quite different from the brain in terms of structure. Like the brain, however, a neural net is a massively parallel collection of small and simple processing units where the interconnections form a large part of the network's intelligence; however, in terms of scale a brain is massively larger than a neural network, the units used in a neural network are typically far simpler than neurons, and the learning processes of the brain (whilst unknown) are almost certainly distinct from those of neural networks.

A typical feedforward neural network will consist of a set of nodes. Some of these are designated input nodes, some output nodes, and those in between hidden nodes. There are also connections between the neurons, with a number referred to as a weight associated with each connection. When the network is in operation, a value will be applied to each input node - the values being fed in by a human operator, or from environmental sensors, or perhaps from some other program. Each node then passes its given value to the connections leading out from it, and on each connection the value is multiplied by the weight associated with that connection. Each node in the next layer then receives a value which is the sum of the values produced by the connections leading into it, and in each node a simple computation is performed on the value - a sigmoid function is typical. This process is then repeated, with the results being passed through subsequent layers of nodes until the output nodes are reached.

Note: the above is based on a model of the neuron that is from about 1970.

Alternative calculation models in neural networks include models with loops, where some kind of time delay process must be used, and "winner takes all" models, where the neuron with the highest value from the calculation fires and takes a value 1, and all other neurons take the value 0.

Typically the weights in a neural network are initially set to small random values; this represents the network knowing nothing. As the training process proceeds, these weights will converge to values allowing them to perform a useful computation. Thus it can be said that the neural network commences knowing nothing and moves on to gain some real knowledge.

Neural networks are particularly useful for dealing with bounded real-valued data[?], where a real-valued output is desired; in this way neural networks will perform classification by degrees, and are capable of expressing values equivalent to "not sure". If the neural network is trained using the cross-entropy error function (see Bishop's book) and if the neural network output has a sigmoidal non-linear, then the outputs will be estimates of the true posterior probability of a class.

In real life applications, neural networks perform particularly well on the following common tasks:-

Other kinds of neural networks, in particular Continuous-Time Recurrent Neural Networks (CTRNN), are used in conjunction with genetic algorithms(GAs) to produce robot controllers. The genome is then constitued of the networks parameters and the fitness of a network is the adequacy of the behaviour exhibited by the controlled robot (or often by a simulation of this behaviour).

Table of contents

Types of neural networks

Single layer perceptron

The earliest kind of neural network is a single-layer perceptron network, which consists of a single layer of output nodes; the inputs are fed directly to the outputs via a series of weights. In this way it can be considered the simplest kind of feedforward network. The sum of the products of the weights and the inputs is calculated in each node, and if the value is above some threshold (typically 0) the neuron fires and takes the value 1; otherwise it takes the value -1. Neurons with this kind of activation function are also called McCulloch-Pitts neurons or threshold neurons. In the literature the term perceptron often refers to networks consisting of just one of these units.

Perceptrons can be trained by a simple learning algorithm that is usually called the delta-rule. It calculates the errors between calculated output and sample output data, and uses this to create an adjustment to the weights, thus implementing a form of gradient descent.

Single-unit perceptrons are only capable of learning linearly seperable patterns; in 1969 in a famous monograph[?] entitled Perceptrons by Marvin Minsky and Seymour Papert showed that it was impossible for a single layer perceptron network to learn an XOR function. They conjectured (incorrectly) that a similar result would hold for a multi-layer perceptron network. Although a single threshold unit is quite limited in its computational power, it has been shown that networks of parallel threshold units can approximate any continuous function from a compact interval of the real numbers into the interval [-1, 1]. This very recent result can be found in [Auer, Burgsteiner, Maass: The p-delta learning rule for parallel perceptrons, 2001 (state Jan 2003: submitted for publication)].

Multi-layer perceptron

This class of networks consists of multiple layers of computational units, usually interconnected in a feedforward way. This means that each neuron in one layer has directed connections to the neurons of the subsequent layer. In many applications the units of these networks apply a sigmoid function as an activation function.

The universal approximation theorem for neural networks states that every continuous function that maps intervals of real numbers to some output interval of real numbers can be approximted arbitrary closely by a multi-layer perceptron with just one hidden layer. This result holds only for restricted classes of activation functions, e.g. for the sigmoidal functions.

Multi-layer networks use a variety of learning techniques, the most popular being backpropagation. Here the output values are compared with the correct answer to compute the value of some predefined error-function. By various techniques the error is then fed back through the network. Using this information, the algorithm adjusts the weights of each connection in order to reduce the value of the error-function by some small amount. After repeating this process for a sufficiently large number of training cycles the network will usually converge to some state where the error of the calculations is small. In this case one says that the network has learned a certain target function. To adjust weights properly one applies a general method for nonlinear optimization task that is called gradient descent. For this the derivation of the error-function with respect to the network weights is calculated and the weights are then changed such that the error decreases (thus going downhill on the surface of the error function). For this reason backpropagation can only be applied on networks with differentiable activation function.

In general the problem of reaching a network that performs well, even on examples that where not used as training examples, is quite a subtle issue that requires additional techniques. This is especially important for cases where only very limited numbers of training examples are available. One simple technique, called early stopping, often ensures that the network will generalize well for examples out of the training set.

Other typical problems of the back-propagation algorithm are the speed of convergence, the possibility to end up in a local minimum of the error function, and the issue of overfitting (i.e. a situation where the network has been trained too much with a given set of examples, such that it will no longer generalize well to unseen data). Today there are practical solutions that make backpropagation in multi-layer perceptrons the solution of choice for many machine learning tasks.

Simple recurrent network

A simple recurrent network (SRN) is a variation on the multi-layer perceptron, sometimes called an "Elman network" due to its invention by Professor Jeff Elman[?]. A three-layer network is used, with the addition of a set of "context units" in the input layer. There are connections from the middle ("hidden") layer to these context units fixed with weight 1. At each time step, the input is propagated in a standard feedforward fashion, and then a learning rule (usually backpropagation) is applied. The fixed back connections result in the context units always maintaining a copy of the previous values of the hidden units (since they propagate over the connections before the learning rule is applied). Thus the network to maintain a sort of state, allowing it to perform such tasks as sequence-prediction that are beyond the power of a standard multi-layer perceptron.

Support vector machine

A support vector machine (SVM) is a recently developed form of machine learning algorithm. The training of SVMs is based on quadratic programming, a form of optimization that (usually) has only one global minimum. Therefore, some practitioners prefer SVM training to neural network training.

Committee of machines

A committee of machines (CoM) is a collection of different neural networks that together vote on a given example. It has been seen that this gives a much better result. In fact in many cases, starting with the same architecture and training but different initial random weights give vastly different networks. A CoM tends to stabilize the result.

Self-organizing map

The Self-organizing map (SOM), sometimes referred to as "Kohonen map" due to its invention by Professor Teuvo Kohonen[?], is an unsupervised learning technique that reduces the dimensionality of data through the use of a self-organizing neural network. A probabilistic version of SOM is the Generative Topographic Map[?] (GTM) of Bishop, Svensen and Williams.

Other network types

Data representation

(Some notes on statistics and other representation problems in here)

Relation to optimization techniques

Analysis of many neural network techinques reveals a close relationship to mathematical optimization techniques.

For instance, multi-layer perceptron back-propagation can be substituted with more general global optimization techniques. The objective in training a ANN is, given some set of pairs of data and output, { (d0, o0) , (d1,o1), ... } to minimize some error function ||E||2, where E(xi) = F(w,xi) - oi. Here F is the neural network function which given a vector of weights w and an input vector produces an output vector for the network. Thus as well as using backpropagation to train the network, it's also possible to use global optimization techniques to produce a weight vector w.

For very large data sets, using more advanced optimization techniques is often slower than using gradient descent, if the weights of the network are updated by gradient descent after each training example. This is because one sweep of gradient descent through the training set can make a large amount of progress, while the same amount of computational effort can only compute a the true gradient at one setting of the parameter vector.

External links


  • Duda, R.O., Hart, P.E., Stork, D.G. (2001) Pattern classification (2nd edition), Wiley, ISBN 0471056693

  • Hertz, J., Palmer, R.G., Krogh. A.S. (1990) Introduction to the theory of neural computation, Perseus Books. ISBN 0201515601

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
French resistance

... de l'Armée[?] (ORA or Organization of Armed Resistance) - Giraudist ie. composed of supporters of French general Henri Giraud[?]. Francois Mitterrand joined it ...

This page was created in 31.9 ms