DSCTool: A web-service-based framework for statistical comparison of stochastic optimization algorithms

被引:15
作者
Eftimov, Tome [1 ,2 ,3 ]
Petelin, Gasper [4 ]
Korosec, Peter [1 ]
机构
[1] Jozef Stefan Inst, Comp Syst Dept, Ljubljana 1000, Slovenia
[2] Stanford Univ, Dept Biomed Data Sci, Stanford, CA 94305 USA
[3] Stanford Univ, Ctr Populat Hlth Sci, Stanford, CA 94305 USA
[4] Univ Ljubljana, Fac Comp & Informat Sci, Ljubljana 1000, Slovenia
关键词
Statistical tool; Benchmarking; Stochastic optimization algorithms; DSCTool; Web service; EVOLUTIONARY ALGORITHMS;
D O I
10.1016/j.asoc.2019.105977
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
DSCTool is a statistical tool for comparing performance of stochastic optimization algorithms on a single benchmark function (i.e. single-problem analysis) or a set of benchmark functions (i.e., multiple-problem analysis). DSCTool implements a recently proposed approach, called Deep Statistical Comparison (DSC), and its variants. DSC ranks optimization algorithms by comparing distributions of obtained solutions for a problem instead of using a simple descriptive statistic such as the mean or the median. The rankings obtained for an individual problem give the relations between the performance of the applied algorithms. To compare optimization algorithms in the multiple-problem scenario, an appropriate statistical test must be applied to the rankings obtained for a set of problems. The main advantage of DSCTool are its REST web services, which means all its functionalities can be accessed from any programming language. In this paper, we present the DSCTool in detail with examples for its usage. (C) 2019 The Author( s). Published by Elsevier B.V.
引用
收藏
页数:11
相关论文
共 38 条
[31]  
R Core Team, 2016, R LANG ENV STAT COMP
[32]  
Ravber M, 2017, IEEE C EVOL COMPUTAT, P1503, DOI 10.1109/CEC.2017.7969481
[33]   Stepup procedures controlling generalized FWER and generalized FDR [J].
Sarkar, Sanat K. .
ANNALS OF STATISTICS, 2007, 35 (06) :2405-2420
[34]   MULTIVARIATE 2-SAMPLE TESTS BASED ON NEAREST NEIGHBORS [J].
SCHILLING, MF .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1986, 81 (395) :799-806
[35]  
Tusar T, 2007, LECT NOTES COMPUT SC, V4403, P257
[36]   Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features [J].
Weise, Thomas ;
Wang, Xiaofeng ;
Qi, Qi ;
Li, Bin ;
Tang, Ke .
APPLIED SOFT COMPUTING, 2018, 73 :366-382
[37]  
Weise T, 2010, GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P1479
[38]   Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach [J].
Zitzler, E ;
Thiele, L .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (04) :257-271