Improving Automated Algorithm Selection by Advancing Fitness Landscape Analysis
Raphael Patrick Prager

TL;DR
This paper advances automated algorithm selection by improving fitness landscape analysis and developing new methods to generate informative inputs, thereby enhancing model accuracy and extending applicability to diverse problem types.
Contribution
It introduces novel improvements to fitness landscape analysis and informative input generation, expanding the scope and effectiveness of automated algorithm selection.
Findings
Enhanced algorithm selection accuracy through improved landscape analysis
Developed new methods for generating informative inputs
Extended applicability to various problem types
Abstract
Optimization is ubiquitous in our daily lives. In the past, (sub-)optimal solutions to any problem have been derived by trial and error, sheer luck, or the expertise of knowledgeable individuals. In our contemporary age, there thankfully exists a plethora of different algorithms that can find solutions more reliably than ever before. Yet, choosing an appropriate algorithm for any given problem is challenging in itself. The field of automated algorithm selection provides various approaches to tackle this latest problem. This is done by delegating the selection of a suitable algorithm for a given problem to a complex computer model. This computer model is generated through the use of Artificial Intelligence. Many of these computer models rely on some sort of information about the problem to make a reasonable selection. Various methods exist to provide this informative input to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Machine Learning and Data Classification · Evolutionary Algorithms and Applications
