Christopher Stone
An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation
Stone, Christopher; Renau, Quentin; Miguel, Ian; Hart, Emma
Authors
Dr Quentin Renau Q.Renau@napier.ac.uk
Research Fellow
Ian Miguel
Prof Emma Hart E.Hart@napier.ac.uk
Professor
Abstract
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 information per domain, and the potential for transfer learning. A minimum requirement to achieve this is to find a common representation for describing instances from multiple domains. We assess the strengths and weaknesses of three candidate representations (text, images and graphs) which can all be used to describe three different application domains. Two setups are considered: single-task selection where one classifier is trained per domain, each using the same representation, and multi-task selection where a single classifier is trained with data from all three domains to output the best solver per instance. We find that the domain-agnostic representations perform comparably with domain-specific feature-based classifiers with the benefit of providing a generic representation that does not require feature identification or computation, and could be extended to additional domains in future.
Citation
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
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 18th Learning and Intelligent Optimization Conference |
Start Date | Jun 9, 2024 |
End Date | Jun 13, 2024 |
Acceptance Date | Apr 22, 2024 |
Online Publication Date | Jan 3, 2025 |
Publication Date | 2025 |
Deposit Date | Jun 4, 2024 |
Publicly Available Date | Jan 4, 2026 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Pages | 399-414 |
Series Title | Lecture Notes in Computer Science |
Series Number | 14990 |
Series ISSN | 0302-9743 |
Book Title | Learning and Intelligent Optimization |
ISBN | 9783031756221 |
DOI | https://doi.org/10.1007/978-3-031-75623-8_31 |
Keywords | Algorithm Selection; Multi-Task Learning; Combinatorial Optimisation |
Publisher URL | https://link.springer.com/book/9783031756221 |
Files
This file is under embargo until Jan 4, 2026 due to copyright reasons.
Contact repository@napier.ac.uk to request a copy for personal use.
You might also like
On the Utility of Probing Trajectories for Algorithm-Selection
(2024)
Presentation / Conference Contribution
Towards optimisers that `Keep Learning'
(2023)
Presentation / Conference Contribution
Ealain: A Camera Simulation Tool to Generate Instances for Multiple Classes of Optimisation Problem
(2024)
Presentation / Conference Contribution
Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances
(2024)
Presentation / Conference Contribution
Improving Algorithm-Selectors and Performance-Predictors via Learning Discriminating Training Samples
(2024)
Presentation / Conference Contribution
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search