





















Abstract:Selecting the most suitable algorithm for a given problem instance remains a challenging task, particularly in online or dynamic environments where problem characteristics evolve over time. Relying solely on instantaneous performance metrics can result in a reactive and unstable behaviour, often leading to suboptimal algorithm switching. This paper introduces a computationally efficient approach for aggregating an algorithm's performance across multiple problem instances that is fairly immune to erratic variations in instance features. Inspired by features inherent to Reinforcement Learning (RL), this technique encapsulates rewards and penalties into a latent yield that, in turn, triggers exploitation and exploration, consequently resulting in adaptive algorithm switching. The proposed technique employs island models, inspired by Genetic Algorithms, to facilitate parallel exploration and performance exchanges among algorithm populations inhabiting local repertoires. Experimental evaluations on sorting algorithms and robotic obstacle avoidance tasks demonstrate the feasibility and effectiveness of the approach, highlighting its potential in domains where adaptive algorithm selection is critical.
| Comments: | Accepted and published in the Proceedings of the 29th European Conference on Applications of Evolutionary Computation (EvoApplications 2026), held as part of EvoStar 2026, Toulouse, France, April 8 to 10, 2026. Lecture Notes in Computer Science (LNCS), Springer Nature Switzerland |
| Subjects: | Multiagent Systems (cs.MA); Machine Learning (cs.LG); Robotics (cs.RO) |
| Cite as: | arXiv:2605.24436 [cs.MA] |
| (or arXiv:2605.24436v1 [cs.MA] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24436 arXiv-issued DOI via DataCite (pending registration) |
|
| Journal reference: | Applications of Evolutionary Computation, EvoApplications 2026, LNCS, Springer Nature Switzerland, 2026 |
| Related DOI: | https://doi.org/10.1007/978-3-032-23604-3_8
DOI(s) linking to related resources |
From: Jayprakash Nair [view email]
[v1]
Sat, 23 May 2026 07:12:30 UTC (2,690 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。