Skip to content

Topic: Recurrent dynamics

ePoster
2 ePosters
Seminar
1 seminar

In Computational Neuroscience and Neuroscience

Seminar · Computational Neuroscience

Taming chaos in neural circuits

Rainer Engelken · Columbia University

Wed, Feb 23, 2022 · 05:00 UTC

Neural circuits exhibit complex activity patterns, both spontaneously and in response to external stimuli. Information encoding and learning in neural circuits depend on the ability of time-varying stimuli to control spontaneous network activity. In particular, variability arising from the sensitivity to initial conditions of recurrent cortical circuits can limit the information conveyed about the sensory input. Spiking and firing rate network models can exhibit such sensitivity to initial conditions that are reflected in their dynamic entropy rate and attractor dimensionality computed from th

ePoster · Neuroscience

Identifying cortical learning algorithms using Brain-Machine Interfaces

Sofia Pereira da Silva, Denis Alevi, Friedrich Schuessler, Henning Sprekeler · Bernstein Conference 2024

By causally mapping neural activity to behavior [1], Brain-Computer Interfaces (BCI) offer a means to study the dynamics of sensorimotor learning. Here, we combine computational modeling and data analysis to study the neural learning algorithm [2] monkeys use to adapt to a changed output mapping in a center-out reaching task. We exploit that the mapping from neural space (ca. 100 dimensions) to the 2D cursor position is a credit assignment problem [3] that is underconstrained, because changes along a large number of output-null dimensions do not influence the behavioral output. We hypothesized

ePoster · Neuroscience

Learning Hebbian/Anti-Hebbian networks in continuous time

Henrique Reis Aguiar, Matthias Hennig · Bernstein Conference 2024

The brain computes internal representations by applying highly recurrent dynamics to feed-forward input. Such dynamics may be viewed as analogous to the inference step in latent variables models, where one usually follows the gradient of the latent posterior distribution until a stable state is reached. At the stable state, when this gradient has approximately zero norm, a parameter optimization step can be applied to slightly increase the likelihood of the current sample under the model. Here we suggest this procedure, which closely matches the expectation-maximization (EM) algorithm, can be

We use cookies for analytics.