Evidence map›Paper›PMID 35310544›Full record

ArticleStatistics and computing2022

Optimal Bayesian design for model discrimination via classification.

Markus Hainy, David J Price, Olivier Restif, Christopher Drovandi

Abstract read
In one paragraph

Article in Statistics and computing, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Making models disagree to learn how brains compute.Nature reviews. Neuroscience · 2026
    Review
  2. Article
  3. Article
  4. 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

4 authors.

Markus HainyDepartment of Applied Statistics, Johannes Kepler University, 4040 Linz, Austria.ORCID 0000-0003-4834-0250
David J PriceCentre for Epidemiology and Biostatistics, Melbourne School of Population and Global Health, The University of Melbourne, Melbourne, VIC 3010 Australia.ORCID 0000-0003-0076-3123
Olivier RestifDepartment of Veterinary Medicine, University of Cambridge, Cambridgeshire, CB3 0ES United Kingdom.ORCID 0000-0001-9158-853X
Christopher DrovandiSchool of Mathematical Sciences, Queensland University of Technology, Brisbane, QLD 4000 Australia.ORCID 0000-0001-9222-8763

Funding

Austrian Science Fund FWF J 3959
6 · The paper itself

Abstract

Performing optimal Bayesian design for discriminating between competing models is computationally intensive as it involves estimating posterior model probabilities for thousands of simulated data sets. This issue is compounded further when the likelihood functions for the rival models are computationally expensive. A new approach using supervised classification methods is developed to perform Bayesian optimal model discrimination design. This approach requires considerably fewer simulations from the candidate models than previous approaches using approximate Bayesian computation. Further, it is easy to assess the performance of the optimal design through the misclassification error rate. The approach is particularly useful in the presence of models with intractable likelihoods but can also provide computational advantages when the likelihoods are manageable. Supplementary Information: The online version contains supplementary material available at 10.1007/s11222-022-10078-2.

Indexed as

Approximate Bayesian computationBayesian model selectionClassification and regression treeContinuous-time Markov processRandom forestSimulation-based Bayesian experimental design

Identifiers

PMID35310544
PMCPMC8924111

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.