<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01225807</id>
  <dt>j</dt>
  <an>01225807</an>
  <augroup>
    <au>Gorban', A.N.</au>
  </augroup>
  <ti>A generalized approximation theorem and computational capabilities of neural networks.</ti>
  <so>Sib. Zh. Vychisl. Mat. 1, No.1, 12-24 (1998).</so>
  <py>1998</py>
  <pu>Rossijskaya Akademiya Nauk, Sibirskoe Otdelenie, Novosibirsk; Izdatel'stvo SO RAN, Novosibirsk</pu>
  <lagroup>
    <la>RU</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>artificial neural networks</ut>
    <ut>generalized Stone theorem</ut>
    <ut>adaptive connection</ut>
    <ut>approximation by superposition of function</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://www.sscc.ru/SibJNM/cont98.html</li>
  </ligroup>
  <abgroup>
    <ab>Author's summary: ``Computational capabilities of artificial neural networks are studied. In this connection, the classical problem arises on representating a function of several variables by means of superpositions and sums of functions of a single variable, and a new vertion of this problem appers (using only one arbitrarily chosen nonlinear function of a single variable). It has been shown that it is possible to obtain an arbitrarily exact approximation of any continuous function of several variables using the operations of summation and multiplication by a number, superposition of functions, linear functions, and one arbitrary continuous nonlinear function of a single variable. For polynomials, an algebraic version of the theorem is proven. For neural networks, the results obtained mean that the only requirement for the activation function of a neuron is nonlinearity''.</ab>
    <rv>S.A.Malyugin (Novosibirsk)</rv>
  </abgroup>
</item>