Exploration/exploitation of a hybrid‐enhanced MPSO‐GA algorithm on a fused CPU‐GPU architecture
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
Summary Recent work in metaheuristic algorithms has shown that solution quality may be improved by composing algorithms with orthogonal characteristics. At the same time, fused CPU‐GPU systems have emerged as a unique platform on which to study these algorithms. Using metaheuristic algorithms requires striking a balance between local and global exploration. There are no governing rules, however, to balance these. In this paper, we study two population‐based metaheuristic algorithms: multi‐swarm particle swarm optimization (MPSO) and genetic algorithms (GAs). We investigate parallel MPSO variants with genetic operators to increase quality: crossover, mutation, swapping, and all three. We develop a hybrid parallel algorithm that combines a slower convergent algorithm (GA) with a faster one (MPSO). The hybrid achieves significant initial improvement in solution quality but no significant difference in the final average fitness. Executing the GA on the GPU requires approximately an order of magnitude less time (0.07–0.18 s) than on the CPU. Our platform is the AMD A8‐3530MX accelerated processing unit that packs four ×86 CPU cores and 80 very long instruction word GPU processing elements. We make effective use of the hierarchical memory structure on the accelerated processing unit, four‐way very long instruction word vectorization, and zero‐copy buffers. Copyright © 2014 John Wiley & Sons, Ltd.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| 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