- Tytuł:
- Benchmarking Procedures for Continuous Optimization Algorithms
- Autorzy:
-
Opara, K.
Arabas, J. - Powiązania:
- https://bibliotekanauki.pl/articles/308400.pdf
- Data publikacji:
- 2011
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
black-box optimization
comparing optimization algorithms
evaluation criteria
parallel computing - Opis:
- Reliable 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.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2011, 4; 73-80
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł