Activation function

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the formalism used to approximate the influence of an extracellular electrical field on neurons, see activating function.

In computational networks, the activation function of a node defines the output of that node given an input or set of inputs. A standard computer chip circuit can be seen as a digital network of activation functions that can be "ON" (1) or "OFF" (0), depending on input. This is similar to the behavior of the linear perceptron in neural networks. However, it is the nonlinear activation function that allows such networks to compute nontrivial problems using only a small number of nodes.

Functions[edit]

In biologically inspired neural networks, the activation function is usually an abstraction representing the rate of action potential firing in the cell. In its simplest form, this function is binary—that is, either the neuron is firing or not. The function looks like \phi(v_i)=U(v_i), where U is the Heaviside step function. In this case a large number of neurons must be used in computation beyond linear separation of categories.

A line of positive slope may also be used to reflect the increase in firing rate that occurs as input current increases. The function would then be of the form \phi(v_i)=\mu v_i, where \mu is the slope. This activation function is linear, and therefore has the same problems as the binary function. In addition, networks constructed using this model have unstable convergence because neuron inputs along favored paths tend to increase without bound, as this function is not normalizable.

All problems mentioned above can be handled by using a normalizable sigmoid activation function. One realistic model stays at zero until input current is received, at which point the firing frequency increases quickly at first, but gradually approaches an asymptote at 100% firing rate. Mathematically, this looks like \phi(v_i)=U(v_i)\tanh(v_i), where the hyperbolic tangent function can also be replaced by any sigmoid function. This behavior is realistically reflected in the neuron, as neurons cannot physically fire faster than a certain rate. This model runs into problems, however, in computational networks as it is not differentiable, a requirement in order to calculate backpropagation.

The final model, then, that is used in multilayer perceptrons is a sigmoidal activation function in the form of a hyperbolic tangent. Two forms of this function are commonly used: \phi(v_i)=\tanh(v_i) whose range is normalized from -1 to 1, and \phi(v_i) = (1+\exp(-v_i))^{-1} is vertically translated to normalize from 0 to 1. The latter model is often considered more biologically realistic, but it runs into theoretical and experimental difficulties with certain types of computational problems.

Alternative structures[edit]

A special class of activation functions known as radial basis functions (RBFs) are used in RBF networks, which are extremely efficient as universal function approximators. These activation functions can take many forms, but they are usually found as one of three functions:

  • Gaussian: \,\phi(v_i)=\exp\left(-\frac{\|v_i-c_i\|^2}{2\sigma^2}\right)
  • Multiquadratics: \,\phi(v_i)=\sqrt{\|v_i-c_i\|^2 + a^2}
  • Inverse multiquadratics: \,\phi(v_i)=(\|v_i-c_i\|^2 + a^2)^{-1/2}

where c_i is the vector representing the function center and a and \sigma are parameters affecting the spread of the radius.

Support vector machines (SVMs) can effectively utilize a class of activation functions that includes both sigmoids and RBFs. In this case, the input is transformed to reflect a decision boundary hyperplane based on a few training inputs called support vectors x. The activation function for the hidden layer of these machines is referred to as the inner product kernel, K(v_i,x)=\phi(v_i). The support vectors are represented as the centers in RBFs with the kernel equal to the activation function, but they take a unique form in the perceptron as

\,\phi(v_i)=\tanh\left(\beta_1 + \beta_0 \sum_j v_{i,j} x_j \right),

where \beta_0 and \beta_1 must satisfy certain conditions for convergence. These machines can also accept arbitrary-order polynomial activation functions where

\,\phi(v_i)=\left(1+\sum_j v_{i,j} x_j \right)^p.[1]

Activation function having types:

  1. Identity function.
  2. Binary step function.
  3. Bipolar step function.
  4. Sigmoidal function.
    1. Binary sigmoidal function.
    2. Bipolar sigmoidal function.
  5. Ramp function.

See also[edit]

References[edit]

  1. ^ Haykin, Simon (1998). Neural Networks: A Comprehensive Foundation (2 ed.). Prentice Hall. ISBN 0-13-273350-1.