A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks.
Synchrony-driven recruitment learning addresses the question of how arbitrary concepts, represented by synchronously active ensembles, may be acquired within a randomly connected static graph of neuron-like elements. Recruitment learning in hierarchies is an inherently unstable process. This paper presents conditions on parameters for a feedforward network to ensure stable recruitment hierarchies. The parameter analysis is conducted by using a stochastic population approach to model a spiking neural network. The resulting network converges to activate a desired number of units at each stage of the hierarchy. The original recruitment method is modified first by increasing feedforward connection density for ensuring sufficient activation, then by incorporating temporally distributed feedforward delays for separating inputs temporally, and finally by limiting excess activation via lateral inhibition. The task of activating a desired number of units from a population is performed similarly to a temporal k-winners-take-all network.
Günay
Cengiz
C
Center for Advanced Computer Studies, Dept. of Biology, University of Louisiana at Lafayette, Lafayette, LA 30322, USA. cgunay@emory.edu
Maida
Anthony S
AS
D025461:Feedback, Physiological; D016014:Linear Models; D008959:Models, Neurological; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated; D012815:Signal Processing, Computer-Assisted; D013269:Stochastic Processes; D013569:Synapses / Q000502:physiology*; D009435:Synaptic Transmission / Q000502:physiology*