Skip to contentSkip to filters

We use cookies for analytics.

Topic: fixed points

Seminar
3 seminars
ePoster
2 ePosters

In Applied Mathematics and Computational Neuroscience

Seminar · Computational Neuroscience

Convex neural codes in recurrent networks and sensory systems

Vladimir Itskov · The Pennsylvania State University

Wed, Dec 14, 2022 · 05:00 UTC

Neural activity in many sensory systems is organized on low-dimensional manifolds by means of convex receptive fields. Neural codes in these areas are constrained by this organization, as not every neural code is compatible with convex receptive fields. The same codes are also constrained by the structure of the underlying neural network. In my talk I will attempt to provide answers to the following natural questions: (i) How do recurrent circuits generate codes that are compatible with the convexity of receptive fields? (ii) How can we utilize the constraints imposed by the convex receptive

Seminar · Dynamical Systems

Modularity of attractors in inhibition-dominated TLNs

Carina Curto · The Pennsylvania State University

Mon, Apr 19, 2021 · 17:00 UTC

Threshold-linear networks (TLNs) display a wide variety of nonlinear dynamics including multistability, limit cycles, quasiperiodic attractors, and chaos. Over the past few years, we have developed a detailed mathematical theory relating stable and unstable fixed points of TLNs to graph-theoretic properties of the underlying network. In particular, we have discovered that a special type of unstable fixed points, corresponding to "core motifs," are predictive of dynamic attractors. Recently, we have used these ideas to classify dynamic attractors in a two-parameter family of inhibition-dominate

Seminar · Computational Neuroscience

Glassy phase in dynamically balanced networks

Gianluigi Mongillo · CNRS

Wed, Feb 17, 2021 · 05:00 UTC

We study the dynamics of (inhibitory) balanced networks at varying (i) the level of symmetry in the synaptic connectivity; and (ii) the ariance of the synaptic efficacies (synaptic gain). We find three regimes of activity. For suitably low synaptic gain, regardless of the level of symmetry, there exists a unique stable fixed point. Using a cavity-like approach, we develop a quantitative theory that describes the statistics of the activity in this unique fixed point, and the conditions for its stability. Increasing the synaptic gain, the unique fixed point destabilizes, and the network exhibits

ePoster · Computational Neuroscience

Identifying task-specific dynamics in recurrent neural networks using Dynamical Similarity Analysis

Alireza Ghalambor, Mohammad Taha Fakharian, Roxana Zeraati, Shervin Safavi · Bernstein Conference 2024

Understanding the circuit mechanisms of brain computation and behavior is one of the central questions in neuroscience. Recent advances in task-optimized recurrent neural networks (RNNs) have opened a new avenue to directly link neural dynamics to behavior and uncover the underlying mechanisms by reverse engineering the trained RNNs. Previous studies leveraged fixed points to compare RNNs across limited tasks and found that while the geometry of neural representations varies, fixed point topology is consistent across RNNs despite differences in model architecture [1]. However, linearizing dyna

ePoster · Computational Neuroscience

Inferring stochastic low-rank recurrent neural networks from neural data

Matthijs Pals, A Sağtekin, Felix Pei, Manuel Gloeckler, Jakob Macke · Bernstein Conference 2024

A central aim in computational neuroscience is to relate the activity of large populations of neurons to an underlying dynamical system. Models of these neural dynamics should ideally be both interpretable and fit the observed data well. Low-rank recurrent neural networks (RNNs) exhibit such interpretability by having tractable dynamics. However, it is unclear how to best fit low-rank RNNs to data consisting of noisy observations of an underlying stochastic system. Here, we propose to fit stochastic low-rank RNNs with variational sequential Monte Carlo methods. We validate our method on severa