Bibliographic record
Abstract
A recently developed metamodel, radial basis function-based high-dimensional model representation (RBF-HDMR), shows promise as a metamodel for high-dimensional expensive black-box functions. This work extends the modeling capability of RBF-HDMR from the current second-order form to any higher order. More importantly, the modeling process “uncovers” black-box functions so that not only is a more accurate metamodel obtained, but also key information about the function can be gained and thus the black-box function can be turned “white.” The key information that can be gained includes: (1) functional form, (2) (non)linearity with respect to each variable, and (3) variable correlations. The black-box “uncovering” process is based on identifying the existence of certain variable correlations through two derived theorems. The adaptive process of exploration and modeling reveals the black-box functions until all significant variable correlations are found. The black-box functional form is then represented by a structure matrix that can manifest all orders of correlated behavior of the variables. The resultant metamodel and its revealed inner structure lend themselves well to applications such as sensitivity analysis, decomposition, visualization, and optimization. The proposed approach is tested with theoretical and practical examples. The test results demonstrate the effectiveness and efficiency of the proposed approach.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".