MétaCan
Menu
Back to cohort
Record W7024608355

Selecting optimal follow-up split-plot designs

2019· dissertation· en· W7024608355 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

VenueMspace (University of Manitoba) · 2019
Typedissertation
Languageen
FieldDecision Sciences
TopicOptimal Experimental Design Methods
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsOptimal designSelection (genetic algorithm)Design of experimentsSequential analysisPoint (geometry)
DOInot available

Abstract

fetched live from OpenAlex

Split-plot designs and follow-up designs have been considered in literature for many years. However, no research has been done on selecting optimal follow-up split-plot designs for response surface methodology. In this thesis, we will find optimal follow-up split-plot designs. We modify Pareto-based coordinate exchange algorithm and apply it to follow-up split-plot designs. The algorithm allows for selecting optimal follow-up designs based on multiple criteria under user-specified models. We use DP- and I-criteria to select optimal follow-up split-plot designs. D$_{s}$ criterion and potential bias caused by model misspecification are also considered to further select optimal designs. Examples are given to illustrate the methods of selecting follow-up designs. Different follow-up run sizes are considered. Comparisons are made among the combined designs with the same follow-up run size.

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 categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Qualitative · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.713
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.001

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.113
GPT teacher head0.352
Teacher spread0.239 · 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