EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Signatures of criticality in efficient coding networks

Shervin Safavi iD, Matthew Chalk iD, Nikos K Logothetis, Anna Levina iD

Proceedings of the National Academy of Sciences · 2024

DOI: 10.1073/pnas.2302730121 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, 2024. Verfasst von Shervin Safavi und 3 weiteren Autor:innen. Beteiligte Einrichtung: Computational Neuroscience, Department of Child and Adolescent Psychiatry, Faculty of Medicine, Technische Universität Dresden, Dresden 01307, German…. Hauptthemen laut MEDLINE: Models, Neurological, Neurons, Nerve Net, Synaptic Transmission. Die Arbeit wurde bisher 35-mal zitiert (Crossref) und nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Max-Planck-Gesellschaft (MPG), Alexander von Humboldt-Stiftung (AvH), Machine Learning Cluster of Excellence.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The critical brain hypothesis states that the brain can benefit from operating close to a second-order phase transition. While it has been shown that several computational aspects of sensory processing (e.g., sensitivity to input) can be optimal in this regime, it is still unclear whether these computational benefits of criticality can be leveraged by neural systems performing behaviorally relevant computations. To address this question, we investigate signatures of criticality in networks optimized to perform efficient coding. We consider a spike-coding network of leaky integrate-and-fire neurons with synaptic transmission delays. Previously, it was shown that the performance of such networks varies nonmonotonically with the noise amplitude. Interestingly, we find that in the vicinity of the optimal noise level for efficient coding, the network dynamics exhibit some signatures of criticality, namely, scale-free dynamics of the spiking and the presence of crackling noise relation. Our work suggests that two influential, and previously disparate theories of neural processing optimization (efficient coding and criticality) may be intimately related.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Models, NeurologicalNeuronsNerve NetSynaptic TransmissionAction PotentialsBrainHumansAnimals

Stichwörter der Autor:innen

criticalityefficient codingneural computationneural dynamics

Autor:innen und Institutionen

  • Computational Neuroscience, Department of Child and Adolescent Psychiatry, Faculty of Medicine, Technische Universität Dresden, Dresden 01307, Germany.
  • Department of Physiology of Cognitive Processes, Max Planck Institute for Biological Cybernetics, Tübingen 72076, Germany.
  • Institut de la Vision, INSERM, CNRS, Sorbonne Université, Paris 75014, France.
  • International Center for Primate Brain Research, Shanghai 201602, China.
  • Department of Computer Science, University of Tübingen, Tübingen 72076, Germany.
  • Bernstein Center for Computational Neuroscience Tübingen, Tübingen 72076, Germany.

ORCID-Profile: Shervin Safavi, Matthew Chalk, Anna Levina

Förderung

  • Max-Planck-Gesellschaft (MPG)
  • Alexander von Humboldt-Stiftung (AvH)
  • Machine Learning Cluster of Excellence
  • Agence Nationale de la Recherche (ANR)
  • Shanghai Municipal Science and Technology Major Project

Zitieren

APA

Safavi, S., Chalk, M., Logothetis, N. K., & Levina, A. (2024). Signatures of criticality in efficient coding networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2302730121

Vancouver

Safavi S, Chalk M, Logothetis NK, Levina A. Signatures of criticality in efficient coding networks. Proceedings of the National Academy of Sciences. 2024. doi:10.1073/pnas.2302730121

BibTeX
@article{Safavi2024,
  author = {Safavi, Shervin and Chalk, Matthew and Logothetis, Nikos K and Levina, Anna},
  title = {Signatures of criticality in efficient coding networks},
  journal = {Proceedings of the National Academy of Sciences},
  year = {2024},
  doi = {10.1073/pnas.2302730121}
}
Kostenlos starten →