The simultaneous approximation order by neural networks with a squashing function
Bull. Korean Math. Soc. 2009 Vol. 46, No. 4, 701-712
Printed July 1, 2009
Nahmwoo Hahm
University of Incheon
Abstract : 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
Downloads: Full-text PDF  

Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail:   | Powered by INFOrang Co., Ltd