THE SIMULTANEOUS APPROXIMATION ORDER BY NEURAL NETWORKS WITH A SQUASHING FUNCTION
Nahmwoo Hahm · Bulletin of the Korean Mathematical Society · 2009
In this paper, we study the simultaneous approximation to functions in $C^m$ [0, 1] by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive.