MétaCan
Menu
Back to cohort
Record W2149775970 · doi:10.1098/rspa.2014.0697

Reduced dimensional Gaussian process emulators of parametrized partial differential equations based on Isomap

2014· article· en· W2149775970 on OpenAlexaff
Wei Xing, A.A. Shah, Prasanth B. Nair

Bibliographic record

VenueProceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 2014
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsIsomapDimensionality reductionEmulationCurse of dimensionalitySubspace topologyGaussian processNonlinear dimensionality reductionMathematicsKernel (algebra)Nonlinear systemAlgorithmMathematical optimizationComputer scienceGaussianApplied mathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, Isomap and kernel Isomap are used to dramatically reduce the dimensionality of the output space to efficiently construct a Gaussian process emulator of parametrized partial differential equations. The output space consists of spatial or spatio-temporal fields that are functions of multiple input variables. For such problems, standard multi-output Gaussian process emulation strategies are computationally impractical and/or make restrictive assumptions regarding the correlation structure. The method we develop can be applied without modification to any problem involving vector-valued targets and vector-valued inputs. It also extends a method based on linear dimensionality reduction to response surfaces that cannot be described accurately by a linear subspace of the high dimensional output space. Comparisons to the linear method are made through examples that clearly demonstrate the advantages of nonlinear dimensionality reduction.

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.004
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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.009
GPT teacher head0.238
Teacher spread0.229 · 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
GenreEmpirical

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

Citations32
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the Royal Society A Mathematical Physical and Engineering SciencesSame topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207