Algorithm selection

Algorithm selection

Algorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose an algorithm from a portfolio on an instance-by-instance basis. It is motivated by the observation that on many practical problems, different algorithms have different performance characteristics. That is, while one algorithm performs well in some scenarios, it performs poorly in others and vice versa for another algorithm. If we can identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. The only prerequisite for applying algorithm selection techniques is that there exists (or that there can be constructed) a set of complementary algorithms.

Comment
enAlgorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose an algorithm from a portfolio on an instance-by-instance basis. It is motivated by the observation that on many practical problems, different algorithms have different performance characteristics. That is, while one algorithm performs well in some scenarios, it performs poorly in others and vice versa for another algorithm. If we can identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. The only prerequisite for applying algorithm selection techniques is that there exists (or that there can be constructed) a set of complementary algorithms.
Depiction
Portfolio correlation as.png
Shapley Values on SAT12-INDU ASlib Scenario.png
Has abstract
enAlgorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose an algorithm from a portfolio on an instance-by-instance basis. It is motivated by the observation that on many practical problems, different algorithms have different performance characteristics. That is, while one algorithm performs well in some scenarios, it performs poorly in others and vice versa for another algorithm. If we can identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. The only prerequisite for applying algorithm selection techniques is that there exists (or that there can be constructed) a set of complementary algorithms.
Is primary topic of
Algorithm selection
Label
enAlgorithm selection
Link from a Wikipage to an external page
www.coseal.net/aslib/
larskotthoff.github.io/assurvey/
Link from a Wikipage to another Wikipage
Algorithmic technique
Answer set programming
Answer Set Programming
Automated planning and scheduling
Boolean satisfiability problem
Category:Constraint programming
Category:Machine learning
Conjunctive normal form
Constraint satisfaction problem
Evolutionary algorithm
File:Portfolio correlation as.png
File:Shapley Values on SAT12-INDU ASlib Scenario.png
Hierarchical clustering
Hyper-heuristic
Linear programming
Machine learning
MAXSAT
Meta-learning (computer science)
Multi-agent system
Multi-class classification
QBF
SAT solver
Travelling salesman problem
Vehicle routing problem
SameAs
2dgKE
Q28324862
Subject
Category:Constraint programming
Category:Machine learning
Thumbnail
Portfolio correlation as.png?width=300
WasDerivedFrom
Algorithm selection?oldid=1119690831&ns=0
WikiPageLength
14858
Wikipage page ID
50773876
Wikipage revision ID
1119690831
WikiPageUsesTemplate
Template:Reflist
Template:Short description
Template:Use dmy dates