MétaCan
Menu
Back to cohort
Record W2788310267 · doi:10.1093/biomet/asx022

OUP accepted manuscript

2017· article· en· W2788310267 on OpenAlexafffund
Fasheng Sun, Boxin Tang

Bibliographic record

VenueBiometrika · 2017
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsMathematics

Abstract

fetched live from OpenAlex

Orthogonal Latin hypercubes provide a class of useful designs for computer experiments. Among the available methods for constructing such designs, the method of rotation is particularly prominent due to its theoretical appeal as well as its space-filling properties. This paper presents a general method of rotation for constructing orthogonal Latin hypercubes, making the rotation idea applicable to many more situations than the original method allows. In addition to general theoretical results, many new orthogonal Latin hypercubes are obtained and tabulated.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.254
Threshold uncertainty score0.362

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.001
Scholarly communication0.0080.002
Open science0.0020.005
Research integrity0.0040.003
Insufficient payload (model declined to judge)0.7460.657

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.039
GPT teacher head0.311
Teacher spread0.272 · 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

Classification

machine, unvalidated

Machine predicted; the direct Gemma label and the distilled Codex classifier agree on what is shown here.

Study designNot applicable
Domainnot available
GenreOther

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations15
Published2017
Admission routes2
Has abstractyes

Explore more

Same venueBiometrikaSame topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207