Dynamic analysis of a general class of winner-take-all competitive neural networks

  • Authors:
  • Yuguang Fang;Michael A. Cohen;Thomas G. Kincaid

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL;Department of Cognitive and Neural Systems, Boston University, Boston, MA;Department of Electrical and Computer Engineering, Boston University, Boston, MA

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies a general class of dynamical neural networks with lateral inhibition, exhibiting winner-take-all (WTA) behavior. These networks are motivated by a metal-oxide-semiconductor field effect transistor (MOSFET) implementation of neural networks, in which mutual competition plays a very important role.We show that for a fairly general class of competitive neural networks, WTA behavior exists. Sufficient conditions for the network to have aWTA equilibrium are obtained, and rigorous convergence analysis is carried out. The conditions for the network to have the WTA behavior obtained in this paper provide design guidelines for the network implementation and fabrication. We also demonstrate that whenever the network gets into the WTA region, it will stay in that region and settle down exponentially fast to the WTA point. This provides a speeding procedure for the decision making: as soon as it gets into the region, the winner can be declared. Finally, we show that this WTA neural network has a self-resetting property, and a resetting principle is proposed.