Outputs (7)

On the Utility of Probing Trajectories for Algorithm-Selection
Presentation / Conference Contribution
Renau, Q., & Hart, E. (2024, April). On the Utility of Probing Trajectories for Algorithm-Selection. Presented at EvoStar 2024, Aberystwyth, UK

Machine-learning approaches to algorithm-selection typically take data describing an instance as input. Input data can take the form of features derived from the instance description or fitness landscape , or can be a direct representation of the ins... Read More about On the Utility of Probing Trajectories for Algorithm-Selection.

Towards optimisers that `Keep Learning'
Presentation / Conference Contribution
Hart, E., Miguel, I., Stone, C., & Renau, Q. (2023, July). Towards optimisers that `Keep Learning'. Presented at Companion Conference on Genetic and Evolutionary Computation, Lisbon, Portugal

We consider optimisation in the context of the need to apply an optimiser to a continual stream of instances from one or more domains, and consider how such a system might 'keep learning': by drawing on past experience to improve performance and lear... Read More about Towards optimisers that `Keep Learning'.

Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples
Presentation / Conference Contribution
Renau, Q., & Hart, E. (2024, July). Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples. Presented at GECCO 2024, Melbourne, Australia

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-selection that use short trajec-tories obtained from running a solver as input... Read More about Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples.

Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances
Presentation / Conference Contribution
Hart, E., Renau, Q., Sim, K., & Alissa, M. (2024, September). Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances. Presented at 18th International Conference on Parallel Problem Solving From Nature PPSN 2024, Hagenburg, Austria

Deep neural networks (DNN) are increasingly being used to perform algorithm-selection in combinatorial optimisation domains, particularly as they accommodate input representations which avoid designing and calculating features. Mounting evidence fro... Read More about Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances.

Ealain: A Camera Simulation Tool to Generate Instances for Multiple Classes of Optimisation Problem
Presentation / Conference Contribution
Renau, Q., Dreo, J., & Hart, E. (2024, July). Ealain: A Camera Simulation Tool to Generate Instances for Multiple Classes of Optimisation Problem. Presented at GECCO '24: Genetic and Evolutionary Computation Conference, Melbourne, Australia

Artificial benchmark datasets are common in both numerical and discrete optimisation domains. Existing benchmarks cover a broad range of classes of optimisation, but as a general rule have limited value due to their poor resemblance to real-world pro... Read More about Ealain: A Camera Simulation Tool to Generate Instances for Multiple Classes of Optimisation Problem.

Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection
Presentation / Conference Contribution
Renau, Q., & Hart, E. (2024, September). Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection. Presented at 18th International Conference, PPSN 2024, Hagenberg, Austria

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 analysis phase, e.g. where features are computed by sampling solution... Read More about Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection.

An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation
Presentation / Conference Contribution
Stone, C., Renau, Q., Miguel, I., & Hart, E. (2024, June). An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation. Presented at 18TH Learning and Intelligent Optimization Conference, Ischia, Italy

We address the question of multi-task algorithm selection in combinatorial optimisation domains. This is motivated by a desire to simplify the algorithm-selection pipeline by developing a more general classifier that does not require specialised info... Read More about An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation.