Proceedings of the Open Algorithm Selection Challenge Held in Brussels, Belgium on 11-12 September 2017 Published as Volume 79 by the Proceedings of Machine Learning Research on 21 December 2017. Volume Edited by: Marius Lindauer Jan N. van Rijn Lars Kotthoff Series Editors: Neil D. Lawrence Mark Reid https://proceedings.mlr.press/v79/ Wed, 08 Feb 2023 10:42:54 +0000 Wed, 08 Feb 2023 10:42:54 +0000 Jekyll v3.9.3 In this paper, we describe our algorithm selection with Auto-sklearn (as-asl) software as it was entered in the 2017 Open Algorithm Selection Challenge. as-asl first selects informative sets of features and then uses those to predict distributions of algorithm runtimes. A classifier uses those predictions, as well as the informative features, to select an algorithm for each problem instance. Our source code is publicly available with the permissive MIT license. Thu, 21 Dec 2017 00:00:00 +0000 https://proceedings.mlr.press/v79/malone17a.html https://proceedings.mlr.press/v79/malone17a.html The SUNNY algorithm is a portfolio technique originally tailored for Constraint Satisfaction Problems (CSPs). SUNNY allows to select a set of solvers to be run on a given CSP, and was proven to be effective in the MiniZinc Challenge, i.e., the yearly international competition for CP solvers. In 2015, SUNNY was compared with other solver selectors in the first ICON Challenge on algorithm selection with less satisfactory performance. In this paper we briefly describe the new version of the SUNNY approach for algorithm selection, that was submitted to the first Open Algorithm Selection Challenge. Thu, 21 Dec 2017 00:00:00 +0000 https://proceedings.mlr.press/v79/liu17a.html https://proceedings.mlr.press/v79/liu17a.html The 2017 algorithm selection challenge provided a snapshot of the state of the art in algorithm selection and garnered submissions from four teams. In this chapter, we describe the setup of the challenge and the algorithm scenarios that were used. Thu, 21 Dec 2017 00:00:00 +0000 https://proceedings.mlr.press/v79/lindauer17a.html https://proceedings.mlr.press/v79/lindauer17a.html Algorithm portfolios are known to offer robust performances, efficiently overcoming the weakness of every single algorithm on some particular problem instances. The presented asap system relies on the alternate optimization of two complementary portfolio approaches, namely a sequential scheduler and a per-instance algorithm selector. Thu, 21 Dec 2017 00:00:00 +0000 https://proceedings.mlr.press/v79/gonard17a.html https://proceedings.mlr.press/v79/gonard17a.html *Zilla is a model-based approach for algorithm selection and the most recent iteration of the well-known SATzilla project. The new *Zilla system has increased flexibility for the user and is configurable to run with many machine learning models and alternatives for various pre/post processing steps (e.g., presolver selection, feature completion prediction, and solver subset selection). The main additions to our *Zilla pipeline are automated procedures for feature group selection, hyper-parameter tuning, and solver subsampling prior to model building. We submit two versions for the competition that are equivalent except for the choice of per-instance machine learning model. For our first submission, we use a weighted pairwise random forest classifier. For our second submission, we test an experimental approach that offline, builds a weighted pairwise random forest classifier and online, finds the nearest instances based on the average path lengths across trees and optimizes a schedule over those instances. Thu, 21 Dec 2017 00:00:00 +0000 https://proceedings.mlr.press/v79/cameron17a.html https://proceedings.mlr.press/v79/cameron17a.html