Bull. Korean Math. Soc. 2009; 46(4): 701-712
Printed July 1, 2009
https://doi.org/10.4134/BKMS.2009.46.4.701
Copyright © The Korean Mathematical Society.
Nahmwoo Hahm
University of Incheon
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.
Keywords: simultaneous approximation, Bernstein polynomial, squashing function, neural network
MSC numbers: Primary 41A10, 41A29, 65D15
2013; 50(4): 1289-1296
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd