P-Laplacian

In the mathematical theory of neural networks, the universal approximation theorem states that a feed-forward network with a single hidden layer containing a finite number of neurons, the simplest form of the multilayer perceptron, is a universal approximator among continuous functions on compact subsets of Rⁿ, under mild assumptions on the activation function.

One of the first versions of the theorem was proved by George Cybenko in 1989 for sigmoid activation functions.

Kurt Hornik showed in 1991 that it is not the specific choice of the activation function, but rather the multilayer feedforward architecture itself which gives neural networks the potential of being universal approximators. The output units are always assumed to be linear. For notational convenience, only the single output case will be shown. The general case can easily be deduced from the single output case.

Formal statement

The theorem in mathematical terms:

Let φ(·) be a nonconstant, bounded, and monotonically-increasing continuous function. Let I_m denote the m-dimensional unit hypercube [0,1]^m. The space of continuous functions on I_m is denoted by C(I_m). Then, given any function f ∈ C(I_m) and є > 0, there exist an integer N and real constants α_i, b_i ∈ R, w_i ∈ R^m, where i = 1, ..., N such that we may define:

$F(x)=\sum _{i=1}^N{\alpha }_i\phi (w_i^{T}x+b_i)$

as an approximate realization of the function f where f is independent of φ; that is,

$|F(x)-f(x)|<\epsilon$

for all x ∈ I_m. In other words, functions of the form F(x) are dense in C(I_m).

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

Template:Applied-math-stub