ASlib: a benchmark library for algorithm selection
From MaRDI portal
Publication:286390
DOI10.1016/J.ARTINT.2016.04.003zbMATH Open1357.68202arXiv1506.02465OpenAlexW1471542436WikidataQ59585873 ScholiaQ59585873MaRDI QIDQ286390FDOQ286390
Authors: Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fréchette, Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren 
Publication date: 20 May 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Abstract: The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances. The algorithm selection problem is attracting increasing attention from researchers and practitioners in AI. Years of fruitful applications in a number of domains have resulted in a large amount of data, but the community lacks a standard format or repository for this data. This situation makes it difficult to share and compare different approaches effectively, as is done in other, more established fields. It also unnecessarily hinders new researchers who want to work in this area. To address this problem, we introduce a standardized format for representing algorithm selection scenarios and a repository that contains a growing number of data sets from the literature. Our format has been designed to be able to express a wide variety of different scenarios. Demonstrating the breadth and power of our platform, we describe a set of example experiments that build and evaluate algorithm selection models through a common interface. The results display the potential of algorithm selection to achieve significant performance improvements across a broad range of problems and algorithms.
Full work available at URL: https://arxiv.org/abs/1506.02465
Recommendations
- Evaluating ASP and commercial solvers on the CSPLib
- A library hierarchy for implementing scalable parallel search algorithms
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Speeding up algorithm selection using average ranking and active testing by introducing runtime
- A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
- Migration-based algorithm library enrichment for constrained multi-objective optimization and applications in algorithm selection
- scientific article; zbMATH DE number 7415109
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Paramils: an automatic algorithm configuration framework
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- SUNNY: a lazy portfolio approach for constraint solving
- Wrappers for feature subset selection
- Metalearning
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Title not available (Why is that?)
- Title not available (Why is that?)
- A self-adaptive multi-engine solver for quantified Boolean formulas
- SATzilla: portfolio-based algorithm selection for SAT
- Algorithm runtime prediction: methods \& evaluation
- Algorithm portfolios
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Another look at graph coloring via propositional satisfiability
- Operations research at container terminals: a literature update
- Towards objective measures of algorithm performance across instance space
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Hierarchical Hardness Models for SAT
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Experiment databases
- Multi-threaded ASP solving with clasp
- Cell Mapping Techniques for Exploratory Landscape Analysis
- Machine Learning: ECML 2004
- Principles and Practice of Constraint Programming – CP 2004
- Learning from planner performance
Cited In (17)
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
- The algorithm selection competitions 2015 and 2017
- Algorithm selection on a meta level
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- Instance space analysis for the car sequencing problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- Generation techniques for linear programming instances with controllable properties
- Learning context-dependent choice functions
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- \textsc{Alors}: an algorithm recommender system
- A study on the effects of normalized TSP features for automated algorithm selection
- Efficient benchmarking of algorithm configurators via model-based surrogates
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- Automated linear solver selection for simulation of multiphysics processes in porous media
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
Uses Software
This page was built for publication: ASlib: a benchmark library for algorithm selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286390)
