Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers
One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do well on the long runs. We consider the problem of selecting the top performing configurations of Conditional Markov Chain Search (CMCS), a general algorithm schema that includes, for example, VNS. We investigate how the structure of performance on short tests links with those on long tests, showing that significant differences arise between test domains. We propose a “performance envelope” method to exploit the links; that learns when runs should be terminated, but that automatically adapts to the domain.
- 2.Karapetyan, D., Goldengorin, B.: Conditional Markov Chain Search for the simple plant location problem improves upper bounds on twelve Korkel-Ghosh instances. In: Goldengorin B. (ed.) Optimization Problems in Graph Theory, pp. 123–147. Springer (2018). https://doi.org/10.1007/978-3-319-94830-0