Location of Repository

Global convergence and limit cycle behavior of weights of perceptron

By Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Hak-Keung Lam and Muhammad H. U. Nasir

Abstract

In this paper, it is found that the weights of a perceptron are bounded for all initial weights if there exists a nonempty set of initial weights that the weights of the perceptron are bounded. Hence, the boundedness condition of the weights of the perceptron is independent of the initial weights. Also, a necessary and sufficient condition for the weights of the perceptron exhibiting a limit cycle behavior is derived. The range of the number of updates for the weights of the perceptron required to reach the limit cycle is estimated. Finally, it is suggested that the perceptron exhibiting the limit cycle behavior can be employed for solving a recognition problem when downsampled sets of bounded training feature vectors are linearly separable. Numerical computer simulation results show that the perceptron exhibiting the limit cycle behavior can achieve a better recognition performance compared to a multilayer perceptro

Topics: G700 Artificial Intelligence, G420 Networks and Communications
Publisher: IEEE
Year: 2008
DOI identifier: 10.1109/TNN.2007.914187
OAI identifier: oai:eprints.lincoln.ac.uk:2686
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.lincoln.ac.uk/2... (external link)
  • http://dx.doi.org/10.1109/TNN.... (external link)
  • http://eprints.lincoln.ac.uk/2... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.