English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Overlapping E/I neuronal assemblies generate rich network dynamics and enable complex computations

Giannakakis, E., Buendia, V., Vinogradov, O., Khajehabdollahi, S., & Levina, A. (2024). Overlapping E/I neuronal assemblies generate rich network dynamics and enable complex computations. Poster presented at Research in Encoding and Decoding of Neural Ensembles (AREADNE 2024), Milos, Greece.

Item is

Files

show Files

Locators

show
hide
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Giannakakis, E1, Author                 
Buendia, V2, Author                 
Vinogradov, O1, Author                 
Khajehabdollahi, S, Author                 
Levina, A1, Author                 
Affiliations:
1Institutional Guests, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_3505519              
2Department of Computational Neuroscience, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_3017468              

Content

show
hide
Free keywords: -
 Abstract: The connectivity of cortical networks often includes functional clusters of strongly intercon- nected, similarly tuned neurons. While these assemblies are known to include both excitatory and inhibitory neurons, there is a high variability of specificity and connectivity patterns of different neuron types. Although there are theoretical studies linking the presence of excita- tory assemblies with the emergence of rich dynamics in spiking networks [1], the impact of neuron type-specific connectivity patterns on the dynamics and computational capabilities of recurrent networks remains poorly understood. Here, we use mean-field theory to assess the impact of E and I assemblies of varying strengths on the dynamics of a balanced recurrent network. We demonstrate that in networks with sufficiently strong coupling, different levels of clustering among E and I neurons can control the distance from a chaotic transition. In particular, we show that relatively weak I assemblies combined with stronger E assemblies can maintain the network’s dynamics at the edge of chaos. We then evaluate how the topology-induced dynamics impact the computational capabilities of the recurrent network using a reservoir computing model. Specifically, we train our network on the complex task of simultaneously predicting multiple chaotic timeseries. We find that the performance can be optimized for any given average coupling strength (within a reasonable range) by adjusting the relative strength of E and I assemblies. Finally, we use simulation-based inference [2] to evaluate the interaction between the speci- ficity of E and I input, the relative strength of E and I assemblies, and the network performance. We find that in near-chaotic dynamical regimes, broader E than I input can stabilize activity and boost performance. Our findings provide a description of how diverse connectivity between different neuron types can generate complex dynamics associated with superior performance in computational tasks. The connectivity patterns we identify largely coincide with experimentally observed structures in the mammalian cortex, suggesting a potential link between network topology, population dynamics, and the ability to perform challenging computations.

Details

show
hide
Language(s):
 Dates: 2024-06
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: -
 Degree: -

Event

show
hide
Title: Research in Encoding and Decoding of Neural Ensembles (AREADNE 2024)
Place of Event: Milos, Greece
Start-/End Date: 2024-06-25 - 2024-06-29

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research in Encoding and Decoding of Neural Ensembles (AREADNE 2024)
Source Genre: Proceedings
 Creator(s):
Pezaris, JS, Editor
Hatsopoulos, NG, Editor
Affiliations:
-
Publ. Info: Cambridge, MA, USA : AREADNE Foundation
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 73 Identifier: ISSN: 2155-3203