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 |
Public URL | http://researchrepository.napier.ac.uk/Output/3676343 |
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
Evolutionary Computation Combinatorial Optimization.
(2004)
Journal Article
A hyper-heuristic ensemble method for static job-shop scheduling.
(2016)
Journal Article
A research agenda for metaheuristic standardization.
(2015)
Presentation / Conference Contribution
A Lifelong Learning Hyper-heuristic Method for Bin Packing
(2015)
Journal Article