An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search

06/23/2018
by   Thomas Weise, et al.
2

A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on the recent success of Bet-and-Run approaches for restarted local search solvers, we introduce an improved generic Bet-and-Run strategy. The goal is to obtain the best possible results within a given time budget t using a given black-box optimization algorithm. If no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propose to first start k>=1 independent runs of the algorithm during an initialization budget t1<t, pausing these runs, then apply a decision maker D to choose 1<=m<=k runs from them (consuming t2>=0 time units in doing so), and then continuing these runs for the remaining t3=t-t1-t2 time units. In previous Bet-and-Run strategies, the decision maker D=currentBest would simply select the run with the best- so-far results at negligible time. We propose using more advanced methods to discriminate between "good" and "bad" sample runs, with the goal of increasing the correlation of the chosen run with the a-posteriori best one. We test several different approaches, including neural networks trained or polynomials fitted on the current trace of the algorithm to predict which run may yield the best results if granted the remaining budget. We show with extensive experiments that this approach can yield better results than the previous methods, but also find that the currentBest method is a very reliable and robust baseline approach.

READ FULL TEXT
research
09/13/2016

A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover

A common strategy for improving optimization algorithms is to restart th...
research
02/21/2019

Bayes Optimal Early Stopping Policies for Black-Box Optimization

We derive an optimal policy for adaptively restarting a randomized algor...
research
04/27/2022

Run Time Analysis for Random Local Search on Generalized Majority Functions

Run time analysis of evolutionary algorithms recently makes significant ...
research
12/15/2021

Predicting the utility of search spaces for black-box optimization: a simple, budget-aware approach

Black box optimization requires specifying a search space to explore for...
research
03/23/2020

Weighting NTBEA for Game AI Optimisation

The N-Tuple Bandit Evolutionary Algorithm (NTBEA) has proven very effect...
research
08/03/2020

Bet and Run for Test Case Generation

Anyone working in the technology sector is probably familiar with the qu...
research
05/15/2017

Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization

Local consistencies stronger than arc consistency have received a lot of...

Please sign up or login with your details

Forgot password? Click here to reset