To Switch or not to Switch: Predicting the Benefit of Switching between Algorithms based on Trajectory Features

by   Diederick Vermetten, et al.
Edinburgh Napier University
universiteit leiden

Dynamic algorithm selection aims to exploit the complementarity of multiple optimization algorithms by switching between them during the search. While these kinds of dynamic algorithms have been shown to have potential to outperform their component algorithms, it is still unclear how this potential can best be realized. One promising approach is to make use of landscape features to enable a per-run trajectory-based switch. Here, the samples seen by the first algorithm are used to create a set of features which describe the landscape from the perspective of the algorithm. These features are then used to predict what algorithm to switch to. In this work, we extend this per-run trajectory-based approach to consider a wide variety of potential points at which to perform the switch. We show that using a sliding window to capture the local landscape features contains information which can be used to predict whether a switch at that point would be beneficial to future performance. By analyzing the resulting models, we identify what features are most important to these predictions. Finally, by evaluating the importance of features and comparing these values between multiple algorithms, we show clear differences in the way the second algorithm interacts with the local landscape features found before the switch.


page 5

page 8

page 9

page 12


Trajectory-based Algorithm Selection with Warm-starting

Landscape-aware algorithm selection approaches have so far mostly been r...

Chaining of Numerical Black-box Algorithms: Warm-Starting and Switching Points

Dynamic algorithm selection can be beneficial for solving numerical blac...

Per-run Algorithm Selection with Warm-starting using Trajectory-based Features

Per-instance algorithm selection seeks to recommend, for a given problem...

The Hidden Cost of Window Management

Most window management systems support multitasking by allowing users to...

DASH: Dynamic Approach for Switching Heuristics

Complete tree search is a highly effective method for tackling MIP probl...

Towards Feature-Based Performance Regression Using Trajectory Data

Black-box optimization is a very active area of research, with many new ...

Prize insights in probability, and one goat of a recycled error: Jason Rosenhouse's The Monty Hall Problem

The Monty Hall problem is the TV game scenario where you, the contestant...

Please sign up or login with your details

Forgot password? Click here to reset