Generating New Space-Filling Test Instances for Continuous Black-Box Optimization
Created by W.Langdon from
gp-bibliography.bib Revision:1.8154
- @Article{Munoz:2020:EC,
-
author = "Mario A. Munoz and Kate Smith-Miles",
-
title = "Generating New Space-Filling Test Instances for
Continuous Black-Box Optimization",
-
journal = "Evolutionary Computation",
-
year = "2020",
-
volume = "28",
-
number = "3",
-
pages = "379--404",
-
month = "Fall",
-
keywords = "genetic algorithms, genetic programming, GPTIPS,
Algorithm selection, benchmarking, black-box continuous
optimization, exploratory landscape analysis, instance
generator",
-
ISSN = "1063-6560",
-
DOI = "doi:10.1162/evco_a_00262",
-
size = "26 pages",
-
abstract = "This article presents a method to generate diverse and
challenging new test instances for continuous black-box
optimization. Each instance is represented as a feature
vector of exploratory landscape analysis measures. By
projecting the features into a two-dimensional instance
space, the location of existing test instances can be
visualized, and their similarities and differences
revealed. New instances are generated through genetic
programming which evolves functions with controllable
characteristics. Convergence to selected target points
in the instance space is used to drive the evolutionary
process,such that the new instances span the entire
space more comprehensively. We demonstrate the method
by generating two-dimensional functions to visualize
its success, and ten-dimensional functions to test its
scalability. We show that the method can recreate
existing test functions when target points are
co-located with existing functions, and can generate
new functions with entirely different characteristics
when target points are located in empty regions of the
instance space. Moreover, we test the effectiveness of
three state-of-the-art algorithms on the new set of
instances. The results demonstrate that the new set is
not only more diverse than a well-known benchmark set,
but also more challenging for the tested algorithms.
Hence, the method opens up a new avenue for developing
test instances with controllable characteristics,
necessary to expose the strengths and weaknesses of
algorithms, and drive algorithm development.",
-
notes = "Lexicographic tournament selection. cites
\cite{langdon:2006:TEC}.
School of Mathematics and Statistics, The University of
Melbourne, Parkville, Victoria 3010 Australia",
- }
Genetic Programming entries for
Mario Andres Munoz
Kate Smith-Miles
Citations