Approximations of mappings and application to translational invariant networks

Abstract

The author studies the approximation of continuous mappings and dichotomies by one-hidden-layer networks, from a computational point of view. The approach is based on a new approximation method, specially designed for constructing small networks. Upper bounds are given on the size of these networks. These results are specialized to the case of transitional invariant networks, i.e., networks whose outputs are unchanged when their inputs are submitted to a translation.<>