Mixed order associative networks for function approximation, optimisation and sampling

Citation

Swingler K & Smith L (2013) Mixed order associative networks for function approximation, optimisation and sampling. In: ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2013, Bruges, Belgium, 24.04.2013-26.04.2013. ESANN, pp. 23-28. http://www.i6doc.com/en/livre/?GCOI=28001100131010

Abstract
A mixed order associative neural network with n neurons and a modified Hebbian learning rule can learn any functionf : {-1,1}n → R  and reproduce its output as the network's energy function. The network weights are equal to Walsh coecients, the fixed point attractors are local maxima in the function, and partial sums across the weights of the network calculate averages for hyperplanes through the function. If the network is trained on data sampled from a distribution, then marginal and conditional probability calculations may be made and samples from the distribution generated from the network. These qualities make the network ideal for optimisation fitness function modelling and make the relationships amongst variables explicit in a way that architectures such as the MLP do not.

People

Professor Leslie Smith

Emeritus Professor, Computing Science

Professor Kevin Swingler

Professor, Computing Science