MétaCan
Menu
Back to cohort
Record W2074243634 · doi:10.1111/1467-9868.03712

Discussion on the paper by Brooks, Giudici and Roberts

2003· article· en· W2074243634 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of the Royal Statistical Society Series B (Statistical Methodology) · 2003
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Bayesian Inference
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLibrary scienceArt historyArtComputer science

Abstract

fetched live from OpenAlex

This paper aims to develop general strategies for improving jumps between models in reversible jump Markov chain Monte Carlo (MCMC) algorithms, which is quite an important and timely goal. Indeed, in practical implementations of the method, we usually find that the choice of proposals is paramount: in many cases, the ‘natural choice’ leads to a zero acceptance probability and the construction of well-tuned moves is often quite costly. Given that the reversible jump MCMC method is an essential part of the Bayesian toolbox, at least in Bayesian exploratory analysis, a debate is needed for more global strategies on the choice of proposals. The first appealing feature, at the core of the paper, is that image parameters that give a Metropolis–Hastings probability of 1 should be identified as pivotal quantities, just like the current value is a pivot for the random-walk Metropolis–Hastings move. The authors then propose ‘higher order’ methods where some derivatives of the probability are set to 0, but I find this less appealing, because it considerably adds to the complexity of the algorithm.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.055
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.117
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.055
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0010.002
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.070
GPT teacher head0.351
Teacher spread0.281 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it