On error bounds for neural network approximation
Ajit T. Dingankar, Irwin W. Sandberg · 2002
In a recent paper a method is described for constructing certain approximations to a general element in the closure of the convex hull of a subset of an inner product space. This is of interest in connection with neural networks. Here we give an algorithm that generates simpler approximants with somewhat less computational cost.