Competition and Cooperation of Assembly Sequences in Recurrent Neural Networks

Abstract

Neural activity sequences are ubiquitous in the brain and play pivotal roles in functions such as long-term memory formation and motor control. While conditions for storing and reactivating individual sequences have been thoroughly characterized, it remains unclear how multiple sequences may interact when activated simultaneously in recurrent neural networks. This question is especially relevant for weak sequences, comprised of fewer neurons, competing against strong sequences. Using a non-linear rate model with discrete, pre-configured assemblies, we demonstrate that weak sequences can compensate for their competitive disadvantage either by increasing excitatory connections between subsequent assemblies or by cooperating with other co-active sequences. Further, our model suggests that such cooperation can negatively affect sequence speed unless subsequently active assemblies are paired. Our analysis, validated by an analytically tractable linear approximation, characterizes the conditions for successful sequence progression in isolated, competing, and cooperating sequences, and identifies the distinct contributions of recurrent and feed-forward projections. This proof-of-principle study shows how even disadvantaged sequences can be prioritized for reactivation, a process which has recently been implicated in hippocampal memory processing.