Heterogeneous and higher-order cortical connectivity undergirds efficient, robust, and reliable neural codes

被引:0
|
作者
Santander, Daniela Egas [1 ]
Pokorny, Christoph [1 ]
Ecker, Andras [1 ]
Lazovskis, Janis [2 ]
Santoro, Matteo [3 ]
Smith, Jason P. [4 ]
Hess, Kathryn [5 ]
Levi, Ran [6 ]
Reimann, Michael W. [1 ]
机构
[1] Ecole Polytech Fed Lausanne EPFL, Blue Brain Project, Campus Biotech 6, CH-1202 Geneva, Switzerland
[2] Riga Tech Univ, Riga Business Sch, LV-1010 Riga, Latvia
[3] Scuola Int Super Studi Avanzati SISSA, I-34136 Trieste, Italy
[4] Nottingham Trent Univ, Dept Math, Nottingham NG1 4FQ, England
[5] Ecole Polytech Fed Lausanne EPFL, UPHESS, BMI, CH-1015 Lausanne, Switzerland
[6] Univ Aberdeen, Dept Math, Aberdeen AB24 3UE, Scotland
关键词
SYNAPTIC CONNECTIVITY; CELL ASSEMBLIES; VARIABILITY; NEURONS; COMPUTATION; TOPOLOGY; ORGANIZATION; CONNECTOME; NETWORKS; DYNAMICS;
D O I
10.1016/j.isci.2024.111585
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
We hypothesized that the heterogeneous architecture of biological neural networks provides a substrate to regulate the well-known tradeoff between robustness and efficiency, thereby allowing different subpopulations of the same network to optimize for different objectives. To distinguish between subpopulations, we developed a metric based on the mathematical theory of simplicial complexes that captures the complexity of their connectivity by contrasting its higher-order structure to a random control and confirmed its relevance in several openly available connectomes. Using a biologically detailed cortical model and an electron microscopic dataset, we showed that subpopulations with low simplicial complexity exhibit efficient activity. Conversely, subpopulations of high simplicial complexity play a supporting role in boosting the reliability of the network as a whole, softening the robustness-efficiency tradeoff. Crucially, we found that both types of subpopulations can and do coexist within a single connectome in biological neural networks, due to the heterogeneity of their connectivity.
引用
收藏
页数:24
相关论文
共 50 条
  • [41] Efficient Geometric Matching with Higher-Order Features
    Paramanand, C.
    Rajagopalan, A. N.
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 3241 - 3244
  • [42] EFFICIENT COMPUTATION OF HIGHER-ORDER CUMULANT TENSORS
    Domino, Krzysztof
    Gawron, Piotr
    Pawela, Lukasz
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2018, 40 (03): : A1590 - A1610
  • [43] Efficient Higher-Order Clustering on the Grassmann Manifold
    Jain, Suraj
    Govindu, Venu Madhav
    2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 3511 - 3518
  • [44] Efficient optimization with higher-order Ising machines
    Connor Bybee
    Denis Kleyko
    Dmitri E. Nikonov
    Amir Khosrowshahi
    Bruno A. Olshausen
    Friedrich T. Sommer
    Nature Communications, 14
  • [45] Efficient optimization with higher-order ising machines
    Bybee, Connor
    Kleyko, Denis
    Nikonov, Dmitri E.
    Khosrowshahi, Amir
    Olshausen, Bruno A.
    Sommer, Friedrich T.
    NATURE COMMUNICATIONS, 2023, 14 (01)
  • [46] ON THE HIGHER-ORDER APPROXIMATIONS FOR EFFICIENT COMPUTATIONAL ELECTROMAGNETICS
    Gil, Jose Ma
    Zapata, Juan
    Garcia, Jesus
    Gomez, Rafael
    2017 IEEE MTT-S INTERNATIONAL CONFERENCE ON NUMERICAL ELECTROMAGNETIC AND MULTIPHYSICS MODELING AND OPTIMIZATION FOR RF, MICROWAVE, AND TERAHERTZ APPLICATIONS (NEMO), 2017, : 242 - 244
  • [47] Efficient Algorithm and Coding for Higher-Order Compression
    Yaguchi, Kazuya
    Kobayashi, Naoki
    Shinohara, Ayumi
    2014 DATA COMPRESSION CONFERENCE (DCC 2014), 2014, : 434 - 434
  • [48] Tree-structured neural networks: Efficient evaluation of higher-order derivatives and integrals
    Heinz, AP
    IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL II, 2000, : 118 - 122
  • [49] A Reliable Approach for Higher-order Integro-differential Equations
    Noor, Muhammad Aslam
    Mohyud-Din, Syed Tauseef
    APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2008, 3 (02): : 188 - 199
  • [50] A Fast & Robust Solution for Cubic & Higher-Order Polynomials
    Yuksel, Cem
    PROCEEDINGS SIGGRAPH 2022 TALKS, 2022,