MétaCan
Menu
Back to cohort

On the Equivalence of Classic ROC Analysis and the Loss-function Model to Set Cut Points in Sequential Testing

2003· article· en· W2052345280 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

VenueAcademic Medicine · 2003
Typearticle
Languageen
FieldEngineering
TopicIndustrial Vision Systems and Defect Detection
Canadian institutionsUniversity of TorontoUniversity Health Network
Fundersnot available
KeywordsEquivalence (formal languages)Cut-pointSet (abstract data type)StatisticsMathematicsFunction (biology)Receiver operating characteristicComputer scienceArtificial intelligenceDiscrete mathematicsBiology

Abstract

fetched live from OpenAlex

In an effort to reduce the cost of administration for objective structured clinical examinations (OSCEs), several authors have promoted the use of sequential testing in which all candidates take a short screening test and candidates who pass the screen are exempted from taking the full test. Traditionally, the determination of the optimally efficient cut point (passing score) for the screen has used ROC analysis to minimize false-positive and false-negative errors. Recently, Muijtjens et al. have questioned the appropriateness of the ROC method for these purposes and have promoted an alternative method that uses a "loss" formula. However, given certain theoretically derived conditions, it can be shown that the use of the loss formula is functionally identical to using ROC analysis, and the authors suggest that continued use of the ROC method is appropriate.

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.002
metaresearch head score (Gemma)0.001
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.101
Threshold uncertainty score0.221

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.075
GPT teacher head0.298
Teacher spread0.223 · 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