7 papers
Algorithm Selection with Probing Trajectories: Benchmarking the Choice of Classifier Model
Quentin Renau, Emma Hart
Recent approaches to training algorithm selectors in the black-box optimisation domain have advocated for the use of training data that is algorithm-centric in order to encapsulate…
Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing
Kevin Sim, Quentin Renau, Emma Hart
Coupling Large Language Models (LLMs) with Evolutionary Algorithms has recently shown significant promise as a technique to design new heuristics that outperform existing methods,…
Stalling in Space: Attractor Analysis for any Algorithm
Sarah L. Thomson, Quentin Renau, Diederick Vermetten +3
Network-based representations of fitness landscapes have grown in popularity in the past decade; this is probably because of growing interest in explainability for optimisation alg…
Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection
Quentin Renau, Emma Hart
Algorithm-selection (AS) methods are essential in order to obtain the best performance from a portfolio of solvers over large sets of instances. However, many AS methods rely on an…
Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances
Emma Hart, Quentin Renau, Kevin Sim +1
Deep neural networks (DNN) are increasingly being used to perform algorithm-selection in combinatorial optimisation domains, particularly as they accommodate input representations…
Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples
Quentin Renau, Emma Hart
The choice of input-data used to train algorithm-selection models is recognised as being a critical part of the model success. Recently, feature-free methods for algorithm-selectio…