MétaCan
Menu
Back to cohort
Record W2168984786 · doi:10.1109/cec.2007.4425019

Visualizing High Dimensional Objective Spaces for Multi-objective Optimization: A Virtual Reality Approach

2007· article· en· W2168984786 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsNational Research Council Canada
FundersVedecká Grantová Agentúra MŠVVaŠ SR a SAV
KeywordsEmbeddingMulti-objective optimizationMathematical optimizationVirtual realityKnapsack problemComputer sciencePareto principleOptimization problemMathematicsHigh dimensionalTheoretical computer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

This paper presents an approach for constructingvisual representations of high dimensional objective spacesusing virtual reality. These spaces arise from the solutionof multi-objective optimization problems with more than 3objective functions which lead to high dimensional Pareto frontswhich are difficult to use. This approach is preliminarily investigatedusing both theoretically derived high dimensional Paretofronts for a test problem (DTLZ2) and practically obtainedobjective spaces for the 4 dimensional knapsack problem viamulti-objective evolutionary algorithms like HLGA, NSGA, andVEGA. The expected characteristics of the high dimensionalfronts in terms of relative sizes, sequencing, embedding andasymmetry were systematically observed in the constructedvirtual reality spaces.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.084
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0010.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.038
GPT teacher head0.324
Teacher spread0.286 · 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