title: Computing with continuous attractors: stability and online aspects.
abstract: Two issues concerning the application of continuous attractors in neural systems are investigated: the computational robustness of continuous attractors with respect to input noises and the implementation of Bayesian online decoding. In a perfect mathematical model for continuous attractors, decoding results for stimuli are highly sensitive to input noises, and this sensitivity is the inevitable consequence of the system's neutral stability. To overcome this shortcoming, we modify the conventional network model by including extra dynamical interactions between neurons. These interactions vary according to the biologically plausible Hebbian learning rule and have the computational role of memorizing and propagating stimulus information accumulated with time. As a result, the new network model responds to the history of external inputs over a period of time, and hence becomes insensitive to short-term fluctuations. Also, since dynamical interactions provide a mechanism to convey the prior knowledge of stimulus, that is, the information of the stimulus presented previously, the network effectively implements online Bayesian inference. This study also reveals some interesting behavior in neural population coding, such as the trade-off between decoding stability and the speed of tracking time-varying stimuli, and the relationship between neural tuning width and the tracking speed.
authors.affiliation: Department of Informatics, University of Sussex, Brighton, UK. siwu@sussex.ac.uk
authors.forename: Si
authors.initials: S
authors.lastname: Wu
authors.forename: Shun-ichi
authors.initials: S
authors.lastname: Amari
mesh_terms: D006801:Humans; D007858:Learning / Q000502:physiology*; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009474:Neurons / Q000502:physiology*; D017711:Nonlinear Dynamics; D013569:Synapses; D013997:Time Factors