Algorithm portfolios represent a strategy of composing multiple heuristic algorithms, each suited to a different class of problems, within a single general solver that will choose the best suited algorithm for each input. This approach recently gained popularity especially for solving combinatoric problems, but optimization applications are still emerging. The COCO platform of the BBOB workshop series is the current standard way to measure performance of continuous black-box optimization algorithms.
As an extension to the COCO platform, we present the Python-based COCOpf framework that allows composing portfolios of optimization algorithms and running experiments with different selection strategies. In our framework, we focus on black-box algorithm portfolio and online adaptive selection. As a demonstration, we measure the performance of stock SciPy optimization algorithms and the popular CMA algorithm alone and in a portfolio with two simple selection strategies. We confirm that even a naive selection strategy can provide improved performance across problem classes.
M. Nikoli\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia Tel.: +381648650064 F. Mari\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia P. Jani ci\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia
Utilizing Dependence among Variables in Evolutionary Algorithms for Mixed-Integer Programming: A Case Study on Multi-Objective Constrained Portfolio Optimization
East China Normal University(华东师范大学);Indian Statistical Institute(印度统计研究所)
Reinforcement Learning for Portfolio Optimization with a Financial Goal and Defined Time Horizons
AIMS South Africa /Stellenbosch university, South Africa(AIMS南非 /斯托滕博斯大学,南非);University of South Africa, South Africa(南非大学,南非);Michigan State University, USA(密歇根州立大学,美国)