Mohamad Alissa
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches
Alissa, Mohamad; Sim, Kevin; Hart, Emma
Abstract
We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in online bin-packing. Specifically we train two types of recurrent neural networks to predict a packing heuristic in online bin-packing, selecting from four well-known heuristics. As input, the RNN methods only use the sequence of item-sizes. This contrasts to typical approaches to algorithm-selection which require a model to be trained using domain-specific instance features that need to be first derived from the input data. The RNN approaches are shown to be capable of achieving within 5% of the oracle performance on between 80.88 and 97.63% of the instances, depending on the dataset. They are also shown to outperform classical machine learning models trained using derived features. Finally, we hypothesise that the proposed methods perform well when the instances exhibit some implicit structure that results in discriminatory performance with respect to a set of heuristics. We test this hypothesis by generating fourteen new datasets with increasing levels of structure, and show that there is a critical threshold of structure required before algorithm-selection delivers benefit.
Citation
Alissa, M., Sim, K., & Hart, E. (2023). Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches. Journal of Heuristics, 29(1), 1-38. https://doi.org/10.1007/s10732-022-09505-4
Journal Article Type | Article |
---|---|
Acceptance Date | Oct 25, 2022 |
Online Publication Date | Jan 9, 2023 |
Publication Date | 2023-02 |
Deposit Date | Jan 4, 2023 |
Publicly Available Date | Jan 4, 2023 |
Journal | Journal of Heuristics |
Print ISSN | 1381-1231 |
Electronic ISSN | 1572-9397 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 29 |
Issue | 1 |
Pages | 1-38 |
DOI | https://doi.org/10.1007/s10732-022-09505-4 |
Keywords | Deep learning, Machine learning, Recurrent neural network, Algorithm selection, Bin-packing problem, Feature-free approach |
Public URL | http://researchrepository.napier.ac.uk/Output/2957895 |
Files
Automated Algorithm Selection: From Feature-Based To Feature-Free Approaches
(1.1 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
You might also like
A hyper-heuristic ensemble method for static job-shop scheduling.
(2016)
Journal Article
Roll Project Bin Packing Benchmark Problems.
(2015)
Data
A research agenda for metaheuristic standardization.
(2015)
Presentation / Conference Contribution
A Lifelong Learning Hyper-heuristic Method for Bin Packing
(2015)
Journal Article
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 © 2024
Advanced Search