Extension of multiunit global optimisation to three‐input systems
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 Finding the global optimum of an objective function has been of interest in many disciplines. Recently, a global optimisation technique based on multiunit extremum seeking has been proposed for scalar and two‐input systems. The idea of multiunit extremum‐seeking is to control the gradient evaluated using finite difference between two identical units operating with an offset. For scalar systems, it was shown that the global optimum could be obtained by reducing the offset to zero. For two‐input systems, the univariate global optimisation is performed on the circumference of a circle of reducing radius. In this study, the concept is extended to three‐input systems where the circle of varying radius sits on a shrinking sphere. The key contribution lies in formulating the rotation required to keep the best point found in the search domain. The theoretical concepts are illustrated on the global optimisation of several examples. Comparison results with other competitive methods show that the proposed technique performs well in terms of number of function evaluations and accuracy. © 2011 Canadian Society for Chemical Engineering
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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