Sequential Radial Basis Function-Based Optimization Method Using Virtual Sample Generation
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.
Bibliographic record
Abstract
Abstract To further reduce the computational expense of metamodel-based design optimization (MBDO), a novel sequential radial basis function (RBF)-based optimization method using virtual sample generation (SRBF-VSG) is proposed. Different from the conventional MBDO methods with pure expensive samples, SRBF-VSG employs the virtual sample generation mechanism to improve the optimization efficiency. In the proposed method, a least squares support vector machine (LS-SVM) classifier is trained based on expensive real samples considering the objective and constraint violation. The classifier is used to determine virtual points without evaluating any expensive simulations. The virtual samples are then generated by combining these virtual points and their Kriging responses. Expensive real samples and cheap virtual samples are used to refine the objective RBF metamodel for efficient space exploration. Several numerical benchmarks are tested to demonstrate the optimization capability of SRBF-VSG. The comparison results indicate that SRBF-VSG generally outperforms the competitive MBDO methods in terms of global convergence, efficiency, and robustness, which illustrates the effectiveness of virtual sample generation. Finally, SRBF-VSG is applied to an airfoil aerodynamic optimization problem and a small Earth observation satellite multidisciplinary design optimization problem to demonstrate its practicality for solving real-world 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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it