Search Results for author:
Found 3 papers, 1 papers with code
Fast Perturbative Algorithm Configurators
Recent work has shown that the ParamRLS and ParamILS algorithm configurators can tune some simple randomised search heuristics for standard benchmark functions in linear expected time in the size of the parameter space.
Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators
To show this we prove that the simple ParamRLS-F configurator can identify the optimal mutation rates even when using cutoff times that are considerably smaller than the expected optimisation time of the best parameter value for both problem classes.
On the Impact of the Cutoff Time on the Performance of Algorithm Configurators
We evaluate the performance of a simple random local search configurator (ParamRLS) for tuning the neighbourhood size $k$ of the RLS$_k$ algorithm.
