Evidence map›Paper›PMID 37738260›Full record

ArticlePLoS computational biology2023

Simulation-based inference for efficient identification of generative models in computational connectomics.

Jan Boelts, Philipp Harth, Richard Gao, Daniel Udvary, Felipe Yáñez, Daniel Baum, Hans-Christian Hege, Marcel Oberlaender, Jakob H Macke

Abstract read
In one paragraph

Article in PLoS computational biology, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. Article
  2. Building the connectome of a small brain with a simple stochastic developmental generative model.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  3. Article
  4. Pathological cell assembly dynamics in a striatal MSN network model.Frontiers in computational neuroscience · 2024
    Article
  5. Article
  6. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

9 authors.

Jan BoeltsMachine Learning in Science, University of Tübingen, Tübingen, Germany.ORCID 0000-0003-4979-7092
Philipp HarthDepartment of Visual and Data-centric Computing, Zuse Institute Berlin, Berlin, Germany.ORCID 0000-0001-8831-3893
Richard GaoMachine Learning in Science, University of Tübingen, Tübingen, Germany.
Daniel UdvaryIn Silico Brain Sciences, Max Planck Institute for Neurobiology of Behavior - caesar, Bonn, Germany.ORCID 0000-0002-8697-3975
Felipe YáñezIn Silico Brain Sciences, Max Planck Institute for Neurobiology of Behavior - caesar, Bonn, Germany.
Daniel BaumDepartment of Visual and Data-centric Computing, Zuse Institute Berlin, Berlin, Germany.ORCID 0000-0003-1550-7245
Hans-Christian HegeDepartment of Visual and Data-centric Computing, Zuse Institute Berlin, Berlin, Germany.
Marcel OberlaenderIn Silico Brain Sciences, Max Planck Institute for Neurobiology of Behavior - caesar, Bonn, Germany.
Jakob H MackeMachine Learning in Science, University of Tübingen, Tübingen, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Recent advances in connectomics research enable the acquisition of increasing amounts of data about the connectivity patterns of neurons. How can we use this wealth of data to efficiently derive and test hypotheses about the principles underlying these patterns? A common approach is to simulate neuronal networks using a hypothesized wiring rule in a generative model and to compare the resulting synthetic data with empirical data. However, most wiring rules have at least some free parameters, and identifying parameters that reproduce empirical data can be challenging as it often requires manual parameter tuning. Here, we propose to use simulation-based Bayesian inference (SBI) to address this challenge. Rather than optimizing a fixed wiring rule to fit the empirical data, SBI considers many parametrizations of a rule and performs Bayesian inference to identify the parameters that are compatible with the data. It uses simulated data from multiple candidate wiring rule parameters and relies on machine learning methods to estimate a probability distribution (the 'posterior distribution over parameters conditioned on the data') that characterizes all data-compatible parameters. We demonstrate how to apply SBI in computational connectomics by inferring the parameters of wiring rules in an in silico model of the rat barrel cortex, given in vivo connectivity measurements. SBI identifies a wide range of wiring rule parameters that reproduce the measurements. We show how access to the posterior distribution over all data-compatible parameters allows us to analyze their relationship, revealing biologically plausible parameter interactions and enabling experimentally testable predictions. We further show how SBI can be applied to wiring rules at different spatial scales to quantitatively rule out invalid wiring hypotheses. Our approach is applicable to a wide range of generative models used in connectomics, providing a quantitative and efficient way to constrain model parameters with empirical connectivity data.

Indexed as

ConnectomeAnimalsBayes TheoremComputer SimulationMachine LearningNeuronsRats

Identifiers

PMID37738260
PMCPMC10550169

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.