Universal Approximation Using Radial-Basis-Function Networks

  • J. Park
    Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, Texas 78712 USA
  • I. W. Sandberg
    Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, Texas 78712 USA

抄録

<jats:p> There have been several recent studies concerning feedforward networks and the problem of approximating arbitrary functionals of a finite number of real variables. Some of these studies deal with cases in which the hidden-layer nonlinearity is not a sigmoid. This was motivated by successful applications of feedforward networks with nonsigmoidal hidden-layer units. </jats:p><jats:p> This paper reports on a related study of radial-basis-function (RBF) networks, and it is proved that RBF networks having one hidden layer are capable of universal approximation. Here the emphasis is on the case of typical RBF networks, and the results show that a certain class of RBF networks with the same smoothing factor in each kernel node is broad enough for universal approximation. </jats:p>

収録刊行物

被引用文献 (37)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ