Outputs (4)

Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances (2024)
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.

Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples (2024)
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.

An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation (2024)
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.

On the Utility of Probing Trajectories for Algorithm-Selection (2024)
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.