<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Lars Kotthoff, Ian P. Gent, and Ian Miguel, 'An evaluation of machine
learning in algorithm selection for search problems', AI Communica-
tions</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Towards an algorithm selection standard: data format and tools</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lars Kotthoff</string-name>
          <email>larsko@4c.ucc.ie</email>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <volume>270</volume>
      <issue>2012</issue>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The Algorithm Selection Problem is attracting increasing attention
from researchers and practitioners from a variety of different
backgrounds. After decades of fruitful applications in a number of
domains, a lot of data has been generated and many approaches tried,
but the community lacks a standard format or repository for this data.
Furthermore, there are no standard implementation tools. This
situation makes it hard to effectively share and compare different
approaches and results on different data. It also unnecessarily increases
the initial threshold for researchers new to this area.</p>
      <p>In this talk, I will first give a brief introduction to the Algorithm
Selection Problem and approaches to solving it [4, 3]. Then, I will
present a standardized format for representing algorithm selection
scenarios and a repository that contains a growing number of data
sets from the literature, Aslib [1]. The format has been designed to be
able to express a wide variety of different scenarios. In addition to
encoding instance features and algorithm performances, there are
facilities for providing feature costs, the status of algorithm execution and
feature computations, cross-validation splits and meta-information.
In addition to the data format itself, there is an R package that
implements parsers and basic analysis tools. I will illustrate its usage
through a series of examples.</p>
      <p>I will further present LLAMA [2], a modular and extensible toolkit
implemented as an R package that facilitates the exploration of a
range of different portfolio techniques on any problem domain. It
implements the algorithm selection approaches most commonly used in
the literature and leverages the extensive library of machine learning
algorithms and techniques in R. I will provide an overview of the
architecture of LLAMA and the current implementation.</p>
      <p>Leveraging the standard data format and the LLAMA toolkit, I
will conclude this talk by presenting a set of example experiments
that build and evaluate algorithm selection models. The models are
created and evaluated with LLAMA on the problems in the
algorithm selection benchmark repository. The results demonstrate the
potential of algorithm selection to achieve significant performance
improvements even through straightforward application of existing
techniques.</p>
      <p>Together, Aslib and LLAMA provide a low-threshold starting
point for researchers wanting to apply algorithm selection to their
domain or prototype new approaches. Both are under active
development.</p>
      <p>Joint work with Bernd Bischl, Pascal Kerschke, Marius Lindauer,
Yuri Malitsky, Alexandre Fre´chette, Holger Hoos, Frank Hutter,
Kevin Leyton-Brown, Kevin Tierney, and Joaquin Vanschoren.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>