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 条
  • [1] Higher-Order MDS Codes
    Roth, Ron M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (12) : 7798 - 7816
  • [2] Higher-Order CIS Codes
    Carlet, Claude
    Freibert, Finley
    Guilley, Sylvain
    Kiermaier, Michael
    Kim, Jon-Lark
    Sole, Patrick
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) : 5283 - 5295
  • [3] A robust blind neural equalizer based on higher-order cumulants
    Han, Soowhan
    Lee, Imgeun
    TRENDS IN NEURAL COMPUTATION, 2007, 35 : 443 - +
  • [4] Implementation of higher-order methods for robust and efficient compositional simulation
    Mikyska, Jiri
    Firoozabadi, Abbas
    JOURNAL OF COMPUTATIONAL PHYSICS, 2010, 229 (08) : 2898 - 2913
  • [5] Polar Codes with Higher-Order Memory
    Afser, H.
    Delic, H.
    PROBLEMS OF INFORMATION TRANSMISSION, 2018, 54 (04) : 301 - 328
  • [6] Polar Codes with Higher-Order Memory
    H. Afşer
    H. Deliç
    Problems of Information Transmission, 2018, 54 : 301 - 328
  • [7] An effIcient pruning algorithm for sparselized higher-order neural networks
    Wang, YB
    Li, TX
    Li, AY
    Li, WC
    ICAI '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 2005, : 189 - 194
  • [8] How reliable is the connectivity in cortical neural networks?
    Faisal, AA
    Laughlin, SB
    White, JA
    PROCEEDING OF THE 2002 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-3, 2002, : 1661 - 1666
  • [9] Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks
    Li, Jianxin
    Peng, Hao
    Cao, Yuwei
    Dou, Yingtong
    Zhang, Hekai
    Yu, Philip S.
    He, Lifang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (01) : 560 - 574
  • [10] Versatile, robust, and efficient tractography with constrained higher-order tensor fODFs
    Michael Ankele
    Lek-Heng Lim
    Samuel Groeschel
    Thomas Schultz
    International Journal of Computer Assisted Radiology and Surgery, 2017, 12 : 1257 - 1270