Name
Abstract | ||
|---|---|---|
The abundance of algorithms developed to solve different problems has given rise to an important research question: How do we choose the best algorithm for a given problem? Known as algorithm selection, this issue has been prevailing in many domains, as no single algorithm can perform best on all problem instances. Traditional algorithm selection and portfolio construction methods typically treat the problem as a classification or regression task. In this paper, we present a new approach that provides a more natural treatment of algorithm selection and portfolio construction as a ranking task. Accordingly, we develop a Ranking-Based Algorithm Selection (RAS) method, which employs a simple polynomial model to capture the ranking of different solvers for different problem instances. We devise an efficient iterative algorithm that can gracefully optimize the polynomial coefficients by minimizing a ranking loss function, which is derived from a sound probabilistic formulation of the ranking problem. Experiments on the SAT 2012 competition dataset show that our approach yields competitive performance to that of more sophisticated algorithm selection methods. |
Year | Venue | Keywords |
|---|---|---|
2015 | PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | satisfiability problem,ranking |
Field | DocType | Citations |
Mathematical optimization,Algorithmics,Ranking SVM,Ranking,Nondeterministic algorithm,Iterative method,Computer science,Boolean satisfiability problem,FSA-Red Algorithm,Artificial intelligence,Probabilistic logic,Machine learning | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Jayadi Oentaryo | 1 | 80 | 10.00 |
| Stephanus Daniel Handoko | 2 | 95 | 9.18 |
| Hoong Chuin Lau | 3 | 739 | 91.69 |