随机优势
计算机科学
参数统计
优势(遗传学)
标杆管理
非参数统计
数学优化
价值(数学)
算法
统计
机器学习
数学
基因
生物化学
业务
营销
化学
作者
Kenneth V. Price,Abhishek Kumar,Ponnuthurai Nagaratnam Suganthan
标识
DOI:10.1016/j.swevo.2023.101287
摘要
Non-parametric tests can determine the better of two stochastic optimization algorithms when benchmarking results are ordinal—like the final fitness values of multiple trials—but for many benchmarks, a trial can also terminate once it reaches a prespecified target value. In such cases, both the time that a trial takes to reach the target value (or not) and its final fitness value characterize its outcome. This paper describes how trial-based dominance can totally order this two-variable dataset of outcomes so that traditional non-parametric methods can determine the better of two algorithms when one is faster, but less accurate than the other, i.e. when neither algorithm dominates. After describing trial-based dominance, we outline its benefits. We subsequently review other attempts to compare stochastic optimizers, before illustrating our method with the Mann-Whitney U test. Simulations demonstrate that “U-scores” are much more effective than dominance when tasked with identifying the better of two algorithms. We validate U-scores by having them determine the winners of the CEC 2022 competition on single objective, bound-constrained numerical optimization.
科研通智能强力驱动
Strongly Powered by AbleSci AI