# The Interpolation Capablities of the Binary CMAC

Brown, M., Harris, C.J. and Parks, P.C.
(1993)
The Interpolation Capablities of the Binary CMAC.
*Neural Networks*, 6, (3), 429--440.

## Download

Full text not available from this repository.

## Description/Abstract

Within the neurocontrol field the CMAC has often been proposed as a basic learning element because of its simple design and its rapid learning rate. However despite it being used as a general nonlinear functional approximator, very little theory exists about the interpolation capabilities of the binary CMAC. In this paper the binary CMAC is described and an expression for the memory requirements is derived. Then it is shown that the basis function vectors span a space which has a dimension dependent on the length of the weight` vector and the generalisation parameter. From these two expressions it is possible to measure the space of the functions which the CMAC can interpolate and it is shown that, in general, the binary CMAC cannot reproduce an arbitrary multivariate look-up table. This provides an upper bound on the size of the class of functions which the multivariate CMAC can interpolate. Next it is shown that if the desired multivariate (look-up table) function is formed from a linear combination of bounded univariate piecewise constant functions then there exists a well-defined binary CMAC which is output equivalent to the desired function. This provides a lower bound on the type of functions that the multivariate CMAC can interpolate. A set of consistency equations is then derived which the training data must satisfy if the CMAC is required to store the information exactly. Finally these consistency equations are used in the construction of a set of desired functions which the CMAC is completely unable to model. Many neural networks can approximate continuous nonlinear functions arbitrarily well, given infinite resources. However this work is aimed at a more useful measure of the modelling (approximation) capabilities of a network: that is, given a particular network structure (finite resources) what functions can be modelled exactly?

Item Type: | Article |
---|---|

Divisions: | Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Southampton Wireless Group |

ePrint ID: | 250259 |

Date Deposited: | 04 May 1999 |

Last Modified: | 27 Mar 2014 19:51 |

Further Information: | Google Scholar |

URI: | http://eprints.soton.ac.uk/id/eprint/250259 |

### Actions (login required)

View Item |