.png){kind=icon}
返回
Bayesian Performance Analysis for Algorithm Ranking Comparison
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2022.3208110.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the field of optimization and machine learning, the statistical assessment of results has played a key role in conducting algorithmic performance comparisons. Classically, null hypothesis statistical tests have been used. However, recently, alternatives based on Bayesian statistics have shown great potential in complex scenarios, especially when quantifying the uncertainty in the comparison. In this work, we delve deep into the Bayesian statistical assessment of experimental results by proposing a framework for the analysis of several algorithms on several problems/instances. To this end, experimental results are transformed to their corresponding rankings of algorithms, assuming that these rankings have been generated by a probability distribution (defined on permutation spaces). From the set of rankings, we estimate the posterior distribution of the parameters of the studied probability models, and several inferences concerning the analysis of the results are examined. Particularly, we study questions related to the probability of having one algorithm in the first position of the ranking or the probability that two algorithms are in the same relative position in the ranking. Not limited to that, the assumptions, strengths, and weaknesses of the models in each case are studied. To help other researchers to make use of this kind of analysis, we provide a Python package and source code implementation at https://zenodo.org/record/6320599.
Keyword:
Bayesian inference
benchmarking
evolutionary algorithms
probabilistic models on permutation spaces
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
Statistical tests, P values, confidence intervals, and power: a guide to misinterpretations统计检验、p值、置信区间和功效: 误解指南
OAAI
OAAI分享收藏
查看更多内容