کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4609031 1338402 2009 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Complexity of Gaussian-radial-basis networks approximating smooth functions
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات آنالیز ریاضی
پیش نمایش صفحه اول مقاله
Complexity of Gaussian-radial-basis networks approximating smooth functions
چکیده انگلیسی

Complexity of Gaussian-radial-basis-function networks, with varying widths, is investigated. Upper bounds on rates of decrease of approximation errors with increasing number of hidden units are derived. Bounds are in terms of norms measuring smoothness (Bessel and Sobolev norms) multiplied by explicitly given functions a(r,d)a(r,d) of the number of variables dd and degree of smoothness rr. Estimates are proven using suitable integral representations in the form of networks with continua of hidden units computing scaled Gaussians and translated Bessel potentials. Consequences on tractability of approximation by Gaussian-radial-basis function networks are discussed.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Complexity - Volume 25, Issue 1, February 2009, Pages 63–74
نویسندگان
, , ,