MétaCan
Menu
Back to cohort
Record W1977715424 · doi:10.1198/004017006000000228

Variable Selection for Gaussian Process Models in Computer Experiments

2006· article· en· W1977715424 on OpenAlexafffund
Crystal D. Linkletter, Derek Bingham, Nicolas Hengartner, David Higdon, Kenny Ye

Bibliographic record

VenueTechnometrics · 2006
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsSimon Fraser University
FundersLos Alamos National LaboratoryNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsFrequentist inferenceComputer scienceComputer experimentProcess (computing)Gaussian processSelection (genetic algorithm)Variable (mathematics)Bayesian probabilityMachine learningGaussianData miningArtificial intelligenceAlgorithmBayesian inferenceSimulationMathematics

Abstract

fetched live from OpenAlex

In many situations, simulation of complex phenomena requires a large number of inputs and is computationally expensive. Identifying the inputs that most impact the system so that these factors can be further investigated can be a critical step in the scientific endeavor. In computer experiments, it is common to use a Gaussian spatial process to model the output of the simulator. In this article we introduce a new, simple method for identifying active factors in computer screening experiments. The approach is Bayesian and only requires the generation of a new inert variable in the analysis; however, in the spirit of frequentist hypothesis testing, the posterior distribution of the inert factor is used as a reference distribution against which the importance of the experimental factors can be assessed. The methodology is demonstrated on an application in material science, a computer experiment from the literature, and simulated examples.

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.035
metaresearch head score (Gemma)0.068
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.035
Threshold uncertainty score0.186

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0350.068
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.002
Science and technology studies0.0010.004
Scholarly communication0.0020.002
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.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.020
GPT teacher head0.282
Teacher spread0.262 · 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; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations173
Published2006
Admission routes2
Has abstractyes

Explore more

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