MétaCan
Menu
Back to cohort
Record W2096921648 · doi:10.1002/cjs.10045

An efficient computational approach for prior sensitivity analysis and cross‐validation

2010· article· en· W2096921648 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.
fundA Canadian funder is recorded on the work.
venuePublished in a venue whose home country is Canada.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

VenueCanadian Journal of Statistics · 2010
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsUniversity of British Columbia
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceSensitivity (control systems)Bayesian probabilityMonte Carlo methodCross-validationRegularization (linguistics)Model selectionApproximate Bayesian computationComputationContext (archaeology)Machine learningPath (computing)Data miningAlgorithmArtificial intelligenceStatisticsMathematicsEngineering

Abstract

fetched live from OpenAlex

Abstract Prior sensitivity analysis and cross‐validation are important tools in Bayesian statistics. However, due to the computational expense of implementing existing methods, these techniques are rarely used. In this paper, the authors show how it is possible to use sequential Monte Carlo methods to create an efficient and automated algorithm to perform these tasks. They apply the algorithm to the computation of regularization path plots and to assess the sensitivity of the tuning parameter in g ‐prior model selection. They then demonstrate the algorithm in a cross‐validation context and use it to select the shrinkage parameter in Bayesian regression. The Canadian Journal of Statistics 38:47–64; 2010 © 2010 Statistical Society of Canada

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.003
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.398
Threshold uncertainty score0.415

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.046
GPT teacher head0.320
Teacher spread0.274 · 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