Benchmarking Procedures for Continuous Optimization Algorithms
Karol Opara , Jarosław Arabas
AbstractReliable comparison of optimization algorithms requires the use of specialized benchmarking procedures. This paper highlights motivations which influence their structure, discusses evaluation criteria of algorithms, typical ways of presenting and interpreting results as well as related statistical procedures. Discussions are based on examples from CEC and BBOB benchmarks. Moreover, attention is drawn to these features of comparison procedures, which make them susceptible to manipulation. In particular, novel application of the weak axiom of revealed preferences to the field of benchmarking shows why it may be misleading to assess algorithms on basis of their ranks for each of test problems. Additionally, an idea is presented of developing massively parallel implementation of benchmarks. Not only would this provide faster computation but also open the door to improving reliability of benchmarking procedures and promoting research into parallel implementations of optimization algorithms.
|Journal series||Journal of Telecommunications and Information Technology, (B 7 pkt)|
|Keywords in English||black-box optimization, comparing optimization algorithms, evaluation criteria, parallel computing|
|Project||Research on measurment, circuit and signal theory and electronic circuits and systems. Project leader: Romaniuk Ryszard,
, Phone: +48 22 234 7986, +48 22 234 5360, start date 05-04-2012, planned end date 31-12-2012, end date 30-11-2013, ISE/2012/DS, Completed
|Publication indicators||= 10.0; : 2013 = 0.507|
|Citation count*||10 (2020-01-10)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.