Representations of highly-varying functions by perceptron networks

Abstrakt

Tractability of representations of multivariable functions by perceptron networks is investigated. There are described classes of functions which cannot be tractably represented by Heaviside perceptron networks in the sense that all their representations by such networks require numbers of units or sizes of output weights depending exponentially on the number of variables d. It is shown that the concept of variational norm from approximation theory can play a role of a measure of such tractability. Existence of large sets of Boolean functions with variations depending on d exponentially is proven. The results are illustrated by an example of a class of Boolean functions defined in terms of their communication matrices.

Kategorie a štítky

  • Konferenční příspěvek (mezinárodní konf.)