Towards Meta-Algorithm Selection

2020-11-17 · Alexander Tornede, Marcel Wever, Eyke Hüllermeier

Instance-specific algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidates most suitable for a specific instance of an algorithmic problem class, where "suitability" often refers to an algorithm's runtime. Over the past years, a plethora of algorithm selectors have been proposed. As an algorithm selector is again an algorithm solving a specific problem, the idea of algorithm selection could also be applied to AS algorithms, leading to a meta-AS approach: Given an instance, the goal is to select an algorithm selector, which is then used to select the actual algorithm for solving the problem instance. We elaborate on consequences of applying AS on a meta-level and identify possible problems. Empirically, we show that meta-algorithm-selection can indeed prove beneficial in some cases. In general, however, successful AS approaches have problems with solving the meta-level problem.

📄 PDF Abstract BibTeX arXiv:2011.08784

Code (1)

alexandertornede/meta_as 공식 구현

Algorithm Selection on a Meta Level

2021-07-20 · Alexander Tornede, Lukas Gehring, Tanja Tornede, Marcel Wever 외

The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean satisfiability problem, is called instance-specific algorithm selection. Over …

Ensemble Learning Meta-Learning

Siamese Meta-Learning and Algorithm Selection with 'Algorithm-Performance Personas' [Proposal]

2020-06-22 · Joeran Beel, Bryan Tyrell, Edward Bergman, Andrew Collins 외

Automated per-instance algorithm selection often outperforms single learners. Key to algorithm selection via meta-learning is often the (meta) features, which sometimes though do not provide enough information to train a…

Meta-Learning

Model Selection in Contextual Stochastic Bandit Problems

2020-03-03 · NeurIPS 2020 12 · Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao 외

We study bandit model selection in stochastic environments. Our approach relies on a meta-algorithm that selects between candidate base algorithms. We develop a meta-algorithm-base algorithm abstraction that can work wit…

model Model Selection Multi-Armed Bandits

Algorithm selection by rational metareasoning as a model of human strategy selection

2014-12-01 · NeurIPS 2014 12 · Falk Lieder, Dillon Plunkett, Jessica B. Hamrick, Stuart J. Russell 외

Selecting the right algorithm is an important problem in computer science, because the algorithm often has to exploit the structure of the input to be efficient. The human mind faces the same challenge. Therefore, soluti…

Algorithm Selection for Collaborative Filtering: the influence of graph metafeatures and multicriteria metatargets

2018-07-23 · Tiago Cunha, Carlos Soares, André C. P. L. F. de Carvalho

To select the best algorithm for a new problem is an expensive and difficult task. However, there are automatic solutions to address this problem: using Metalearning, which takes advantage of problem characteristics (i.e…

Collaborative Filtering feature selection