Analysis and synthesis of feedforward neural networks using discrete affine wavelet transformations

  • Authors:
  • Y. C. Pati;P. S. Krishnaprasad

  • Affiliations:
  • Dept. of Electr. Eng., Maryland Univ., College Park, MD;-

  • Venue:
  • IEEE Transactions on Neural Networks
  • Year:
  • 1993

Quantified Score

Hi-index 0.02

Visualization

Abstract

A representation of a class of feedforward neural networks in terms of discrete affine wavelet transforms is developed. It is shown that by appropriate grouping of terms, feedforward neural networks with sigmoidal activation functions can be viewed as architectures which implement affine wavelet decompositions of mappings. It is shown that the wavelet transform formalism provides a mathematical framework within which it is possible to perform both analysis and synthesis of feedforward networks. For the purpose of analysis, the wavelet formulation characterizes a class of mappings which can be implemented by feedforward networks as well as reveals an exact implementation of a given mapping in this class. Spatio-spectral localization properties of wavelets can be exploited in synthesizing a feedforward network to perform a given approximation task. Two synthesis procedures based on spatio-spectral localization that reduce the training problem to one of convex optimization are outlined