Multidirectional Prediction Approach for Dynamic Multiobjective Optimization Problems
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
Various real-world multiobjective optimization problems are dynamic, requiring evolutionary algorithms (EAs) to be able to rapidly track the moving Pareto front of an optimization problem once an environmental change occurs. To this end, several methods have been developed to predict the new location of the moving Pareto set (PS) so that the population can be reinitialized around the predicted location. In this paper, we present a multidirectional prediction strategy to enhance the performance of EAs in solving a dynamic multiobjective optimization problem (DMOP). To more accurately predict the moving location of the PS, the population is clustered into a number of representative groups by a proposed classification strategy, where the number of clusters is adapted according to the intensity of the environmental change. To examine the performance of the developed algorithm, the proposed prediction strategy is compared with four state-of-the-art prediction methods under the framework of particle swarm optimization as well as five popular EAs for dynamic multiobjective optimization. Our experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs.
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.001 |
| Science and technology studies | 0.001 | 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