MétaCan
Menu
Back to cohort
Record W1966864823 · doi:10.1115/1.1904639

An Efficient Pareto Set Identification Approach for Multiobjective Optimization on Black-Box Functions

2004· article· en· W1966864823 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Mechanical Design · 2004
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematical optimizationPareto principleRobustness (evolution)Multi-objective optimizationBlack boxComputer scienceComputationSet (abstract data type)Identification (biology)Engineering design processAlgorithmMathematicsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

Both multiple objectives and computation-intensive black-box functions often exist simultaneously in engineering design problems. Few of existing multiobjective optimization approaches addresses problems with expensive black-box functions. In this paper, a new method called the Pareto set pursuing (PSP) method is developed. By developing sampling guidance functions based on approximation models, this approach progressively provides a designer with a rich and evenly distributed set of Pareto optimal points. This work describes PSP procedures in detail. From testing and design application, PSP demonstrates considerable promises in efficiency, accuracy, and robustness. Properties of PSP and differences between PSP and other approximation-based methods are also discussed. It is believed that PSP has a great potential to be a practical tool for multiobjective optimization problems.

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.001
Version: codex-gemma-dda1882f352aValidation 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.219
Threshold uncertainty score0.725

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.298
Teacher spread0.260 · 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