ASlib: a benchmark library for algorithm selection
From MaRDI portal
(Redirected from Publication:286390)
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.
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
Cites work
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Algorithm portfolios
- Algorithm runtime prediction: methods \& evaluation
- Another look at graph coloring via propositional satisfiability
- Cell Mapping Techniques for Exploratory Landscape Analysis
- Experiment databases
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Hierarchical Hardness Models for SAT
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Learning from planner performance
- Machine Learning: ECML 2004
- Metalearning
- Multi-threaded ASP solving with clasp
- Operations research at container terminals: a literature update
- Paramils: an automatic algorithm configuration framework
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Principles and Practice of Constraint Programming – CP 2004
- SATzilla: portfolio-based algorithm selection for SAT
- SUNNY: a lazy portfolio approach for constraint solving
- Towards objective measures of algorithm performance across instance space
- Wrappers for feature subset selection
Cited in
(19)- Generation techniques for linear programming instances with controllable properties
- A biased random-key genetic algorithm for the container pre-marshalling problem
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- Automated linear solver selection for simulation of multiphysics processes in porous media
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Algorithm selection for combinatorial search problems: a survey
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Algorithm selection on a meta level
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- Instance space analysis for the car sequencing problem
- A study on the effects of normalized TSP features for automated algorithm selection
- Learning context-dependent choice functions
- Instance-specific algorithm selection via multi-output learning
- The algorithm selection competitions 2015 and 2017
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- \textsc{Alors}: an algorithm recommender system
Describes a project that uses
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)
