MétaCan
Menu
Back to cohort
Record W1886326043 · doi:10.1287/ited.2013.0120

Bayesian Inference Using Gibbs Sampling in Applications and Curricula of Decision Analysis

2014· article· en· W1886326043 on OpenAlex
Mauricio Díaz, Daniel Frances

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

VenueINFORMS Transactions on Education · 2014
Typearticle
Languageen
FieldDecision Sciences
TopicForecasting Techniques and Applications
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsGibbs samplingComputer sciencePrior probabilityMarkov chain Monte CarloMachine learningInferenceBayesian probabilityBayesian inferenceConjugate priorArtificial intelligenceSoftwareBayes' theoremData mining

Abstract

fetched live from OpenAlex

Applications and curricula of decision analysis currently do not include methods to compute Bayes' rule and obtain posteriors for nonconjugate prior distributions. The current convention is to force the decision maker's belief to take the form of a conjugate distribution, leading to a suboptimal decision. Bayesian inference using Gibbs sampling (BUGS) software, which uses Markov chain Monte Carlo methods, numerically obtains posteriors for nonconjugate priors. By using the decision maker's true nonconjugate belief, the problems explored suggest that BUGS can produce a posterior distribution that leads to optimal decision making. Other methods exist that can use nonconjugate priors, but they must be implemented ad hoc because they do not have any supporting software. BUGS offers the distinct advantage of being implemented in existing software, and with simple coding can solve a wide range of decision analysis problems. BUGS is useful in making optimal decisions, and it is easy to learn and implement; therefore, including BUGS in decision analysis curricula is valuable.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.383

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
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.072
GPT teacher head0.425
Teacher spread0.353 · 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