• Aucun résultat trouvé

Automated Algorithm Selection – Predict which algorithm to use!

N/A
N/A
Protected

Academic year: 2022

Partager "Automated Algorithm Selection – Predict which algorithm to use!"

Copied!
1
0
0

Texte intégral

(1)

Automated Algorithm Selection –Predict which algorithm to use! (Keynote)

Marius Lindauer

University of Freiburg – Automated Algorithm Design – Germany lindauer@informatik.uni-freiburg.de

Abstract. To achieve state-of-the-art performance, it is often crucial to select a suitable algorithm for a given problem instance. For example, what is the best search algorithm for a given instance of a search problem; or what is the best machine learning algorithm for a given dataset? By trying out many different algorithms on many problem instances, developers learn an intuitive mapping from some characteristics of a given problem instance (e.g., the number of fea- tures of a dataset) to a well-performing algorithm (e.g., random forest). The goal of automated algorithm selection is to learn from data, how to automatically se- lect a well-performing algorithm given such characteristics. In this talk, I will give an overview of the key ideas behind algorithm selection and different ap- proaches addressing this problem by using machine learning.

The 1st Interdisciplinary Workshop on Algorithm Selection and Meta-Learning in Information Retrieval (AMIR), 14 April 2019, Cologne, Germany. Editors: Joeran Beel and Lars Kotthoff. Co-located with the 41st European Conference on Infor- mation Retrieval (ECIR). http://amir-workshop.org/

Références

Documents relatifs

value of the hamiltonian of the pseudo-atom and we denote the Hartree-Fock analysis using these harmonic oscillator single particle states as the Hartree-Fock

Cheung and Mosca [7] have shown how to compute the decomposition of an abelian group into a direct product of cyclic subgroups in time polynomial in the logarithm of its order on

We find that DynaMOSA achieves sig- nificantly higher coverage than WSA in a large number of classes (27% and 28% for branch and mutation coverage respectively) with an

Ground-state angular momentum L for N = 7, 8, 9 and 10 bosons with the three-body vibron Hamiltonian (29), as derived from the lower (21) and upper (22) bounds of the

tants de groupements de citadins ont, le 17 octobre, convergé sur Fribourg, répondant à l'appel que PRO FRIBOURG leur avait lancé, face à la très officielle Confrontation des

We propose a new numerical method for the solution of Bernoulli’s free boundary value problem for harmonic functions in a doubly connected domain D in R 2 where an unknown free

To determine the role of the regulation of brain LDLR by PCSK9 and because apoE is the main apolipoprotein in brain that can bind LDLR, we quantifi ed the protein levels of

It compares results from 2D laminar (pseudo-transient) simulations for grids with and without a symmetry plane at C-SCOUT’s centerline, along with those with and without a