Location of Repository

Boundedness of weighted coefficients of perceptron learning algorithm and global convergence of fixed point and limit cycle behaviors

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

Abstract

In this paper, a condition for the boundedness of weighted coefficients of the perceptron with arbitrary initial weights and an arbitrary set of bounded training feature vectors is given and proved. Based on this derived condition, conditions for the global convergence of the output of the perceptron with a set of nonlinearly separable bounded training feature vectors to limit cycles are given and proved, and the maximum number of updates of the weighted coefficients of the perceptron before the output of the perceptron reaches the limit cycles is given. Finally, the perceptron with periodically time varying weighted coefficients is investigated. An optimization approach is proposed for the design of this perceptron. Numerical computer simulation results show that the perceptron with periodically time varying weighted coefficients could achieve better recognition performances compared to that with only one set of weighted coefficients

Topics: H310 Dynamics
Year: 2007
OAI identifier: oai:eprints.lincoln.ac.uk:3094
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/3... (external link)
  • http://eprints.lincoln.ac.uk/3... (external link)
  • Suggested articles


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