Research Article

Adaptive Operator Portfolio Search with Fold Based Landscape Probing

Authors

  • Mei-Lin Nakamura * Department of Computer Sciences, Northeastern University, Boston, MA, USA.
  • Pavel D. Sokolov Department of Electrical and Computer Engineering, Cyprus University of Technology, Limassol, Cyprus.
  • Adaeze O. Okonkwo Department of Computer Science, University of Cape Town, Cape Town, South Africa.

https://doi.org/10.22105/opt.v3i3.116

Abstract

Adaptive operator selection allocates search effort among candidate mechanisms whose usefulness changes with the current population. We study AOP-KFP, a portfolio of nine operators with periodic probing of held-out parents, exponentially smoothed improvement credits, and a softmax distribution mixed with uniform exploration. The folds organize local comparisons within a population snapshot; they do not establish statistical generalization to unseen problems. We give an explicit accounting of probe evaluations and a conditional hitting-probability result for elitist search, while distinguishing these statements from finite-budget performance. The supplied CEC 2017 table contains 25 functions at dimension 30 with 51 reported runs per algorithm. Its displayed means give AOP-KFP 17 row minima, jSO three, EBOwithCMA four, and L-SHADE one. Additional supplied rank, significance, ablation and sensitivity summaries require reconciliation with their underlying observations: several corrected-p-value entries are arithmetically inconsistent, and the reported Sobol first-order indices sum to more than one. The study therefore identifies a testable operator-allocation mechanism and descriptive benchmark evidence, with evaluation accounting and raw-output reconciliation required before confirmatory superiority or reproducibility claims can be made.

Keywords

Adaptive operator selection Population search Held-out parent probing Function-evaluation budget Benchmark comparison
References (27)
  1. [1] Fialho, Á., Da Costa, L., Schoenauer, M., & Sebag, M. (2010). Analyzing bandit-based adaptive operator selection mechanisms. Annals of mathematics and artificial intelligence, 60(1), 25–64. https://doi.org/10.1007/s10472-010-9213-y

  2. [2] Thierens, D. (2005). An adaptive pursuit strategy for allocating operator probabilities. Proceedings of the 7th annual conference on genetic and evolutionary computation (pp. 1539–1546). New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/1068009.1068251

  3. [3] Veček, N., Črepinšek, M., & Mernik, M. (2017). On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms. Applied soft computing, 54, 23–45. https://doi.org/10.1016/j.asoc.2017.01.011

  4. [4] Vargha, A., & Delaney, H. D. (2000). A critique and improvement of the CL common language effect size statistics of McGraw and Wong. Journal of educational and behavioral statistics, 25(2), 101–132. https://doi.org/10.3102/10769986025002101

  5. [5] Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The journal of machine learning research, 7, 1–30. https://doi.org/10.5555/1248547.1248548

Article Metrics

How to Cite

Nakamura, M.-L. ., Sokolov, P. D. ., & Okonkwo, A. O. . (2026). Adaptive Operator Portfolio Search with Fold Based Landscape Probing. Optimality, 3(3), 213-233. https://doi.org/10.22105/opt.v3i3.116

Similar Articles

1-10 of 68

You may also start an advanced similarity search for this article.