The second stage is a linear transformation of the
coarse-coded field, which yields the output field; it is also
implemented by a single layer of neurons. Thus the
transformation is given by
), where
is the input,
is the local field, and L is the linear
transformation.
Notice that this transformation is linear in its input field (which does not imply, however, that it is a linear function of the stimulus values). Since, if there are several significant stimuli, the input field will be a superposition of fields if the individual stimuli, the output will likewise be a superposition of the corresponding individual outputs. Thus this transformation supports a limited kind of parallel computation in superposition. This is especially useful when the output, like the input, is a computational map.
It has been shown (Lowe 1991, Moody & Darken 1989,
Wettschereck & Dietterich 1992) that simple networks of this
form are universal in an important sense, and can adapt
through a simple learning algorithm. For example, as we saw
for direction fields, and input vector
can be coded by a
vector field
to yield a scalar field
,
which is linearly transformed
. Learning
proceeds by slow adaptation of the encoding vector field
and by fast adaptation of the kernel field L.