MétaCan
Menu
Back to cohort
Record W2042983033 · doi:10.1115/detc2007-35517

Reliable Space Pursuing for RBDO With Black-Box Performance Functions

2007· article· en· W2042983033 on OpenAlexaff
S. Shan, G. Gary Wang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsBlack boxComputer scienceComputationProbabilistic logicMathematical optimizationReliability (semiconductor)Point (geometry)Nested loop joinSpace (punctuation)Optimization problemAlgorithmMathematicsData miningArtificial intelligencePower (physics)

Abstract

fetched live from OpenAlex

Reliability-based design optimization (RBDO) is intrinsically a double-loop procedure since it involves an overall optimization and an iterative reliability assessment at each search point. Due to the double-loop procedure, the computational expense of RBDO is normally very high. Current RBDO research is focused on performance functions having explicit analytical expression and readily available gradients. This paper addresses a more challenging type of RBDO problem in which the performance functions are computation intensive. These computation intensive functions are often considered as a “black-box” and their gradients are not available or not reliable. Based on the reliable design space (RDS) concept proposed earlier by the authors, this paper proposes a Reliable Space Pursuing (RSP) approach, in which RDS is first identified and then gradually refined while optimization is performed. It theoretically avoids the nested optimization and probabilistic assessment loop. This approach can apply to RBDO problems with either analytical or blackbox performance functions. Three well known numerical problems from the literature are used to test and demonstrate the effectiveness of RSP.

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 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.003
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.816
Threshold uncertainty score0.389

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.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.000
Open science0.0000.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.059
GPT teacher head0.303
Teacher spread0.244 · 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 teacher head, 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

Citations0
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicProbabilistic and Robust Engineering DesignFrench-language works237,207