DSpace Repository

Convergence Rate of Fourier Neural Networks

Show simple item record

dc.contributor.author Zhumekenov, Abylay
dc.contributor.editor Assylbekov, Zhenisbek
dc.contributor.other Tourassis, Vassilios D.
dc.date.accessioned 2019-08-29T09:43:58Z
dc.date.available 2019-08-29T09:43:58Z
dc.date.issued 2019-04-26
dc.identifier.uri http://nur.nu.edu.kz/handle/123456789/4198
dc.description.abstract The paper investigates a convergence rate for 2-layer feedforward Fourier Neural Network (FNN). Such networks are motivated by the approximation properties of wellknown Fourier series. Several implementations of FNNs were proposed since 1990’s: by Gallant and White; A. Silvescu; Tan, Zuo and Cai; Liu. The main focus of this research is Silvescu’s FNN, because such activation function does not fit into the category of networks, where the linearly transformed input is exposed to activation. The latter ones were extensively described by Hornik in 1989. In regard to non-trivial Silvescu’s FNN, its convergence rate is proven to be of order 𝑂(1/𝑛). The paper continues investigating classes of functions approximated by Silvescu FNN, which appeared to be from Schwartz space and space of positive definite functions. en_US
dc.language.iso en en_US
dc.publisher Nazarbayev University School of Science and Technology en_US
dc.rights Attribution-NonCommercial-ShareAlike 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/us/ *
dc.subject Research Subject Categories::MATHEMATICS::Applied mathematics en_US
dc.title Convergence Rate of Fourier Neural Networks en_US
dc.type Master's thesis en_US
workflow.import.source science


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 3.0 United States