Recurrent Neural Networks (RNNs) are widely used to model neural activity in Computational Neuroscience. Here, we explore the mathematical foundations of three fundamental procedures that can be implemented: temporal rescaling, discretization, and linearization. These techniques provide crucial tools for characterizing the behavior of RNNs, offering insights into their temporal dynamics, facilitating practical computational implementation, and allowing for linear approximations for analysis. We discuss the flexible order in which these procedures can be applied, emphasizing their importance in modeling and analyzing RNNs for neuroscience and formally prove that these three operations commute pairwise. We also explicitly describe the conditions under which these procedures can be considered interchangeable. Our findings directly inform the design of biologically plausible RNN models for simulating neural dynamics observed in decision-making circuits and motor control, where temporal scaling and stability are critical for matching experimental recordings. Furthermore, we show that this exact commutativity guarantees the structural preservation of the network's controllability, preventing the emergence of inaccessible state-spaces under numerical discretization or temporal rescaling.
Training RNNs on delayed decision-making tasks with progressively increasing temporal demands shows that temporal and decision-related computations can emerge through multiple dynamical regimes, while maintaining structured low-dimensional representations and comparable behavioural performance, mirroring biological principles of degeneracy and functional redundancy.
Cecilia Jarne, Ryeongkyung Yoon, Tahra L. Eissa et al.· Journal of Computational Neu...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.