The paper explores the capability of continuous-time recurrent neural networks to store and recall precisely timed spike patterns. Through numerical experiments, the authors demonstrate that within some range of parameters, any random score of spike trains (for all neurons in the network) can be robustly memorized and autonomously reproduced with stable accurate relative timing of all spikes, with probability close to one.
The key highlights are:
The authors use a variation of the Spike Response Model (SRM) as the neuron model, with random axonal transmission delays which are essential for the observed temporal stability.
The synaptic weights are computed offline to satisfy a template that encourages temporal stability, by satisfying a set of constraints on the neuron potentials and their derivatives around the prescribed firing times.
The experiments demonstrate that the required synaptic weights can be found with high probability, and the memorized spike patterns can be stably reproduced even in the presence of substantial threshold noise.
An eigenvalue analysis of a linearized version of the network model confirms that the weight computation method ensures the suppression of small spike timing jitter.
The authors also demonstrate associative recall, where a fraction of neurons are forced to produce noisy versions of the memorized spike patterns, and the remaining autonomous neurons can still accurately reproduce the full memorized content.
The results suggest that the maximal length of stably memorizable content scales at least linearly with the number of synaptic inputs per neuron.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Hugo Aguetta... alle arxiv.org 09-25-2024
https://arxiv.org/pdf/2408.01166.pdfDomande più approfondite