Frank Hutter

dblp:89/5383 · DBLP profile ↗
← Back
7ranked-venue papers in the field
0as first author
3since 2021 · last 2023
0000-0002-2037-3694ORCID · verified

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 7
YearPublicationVenuePosition
2023 Mind the Gap: Measuring Generalization Performance Across Multiple Objectives
Matthias Feurer 0001, Katharina Eggensperger, Edward Bergman, Florian Pfisterer, Bernd Bischl, Frank Hutter
IDA6
2022 Efficient Automated Deep Learning for Time Series Forecasting
Difan Deng, Florian Karl, Frank Hutter, Bernd Bischl, Marius Lindauer
ECML/PKDD (3)3
2021 Bayesian Optimization with a Prior for the Optimum
Artur L. F. Souza, Luigi Nardi, Leonardo B. Oliveira, Kunle Olukotun, Marius Lindauer, Frank Hutter
ECML/PKDD (3)6
2019 Optimizing Neural Networks for Patent Classification
Louay Abdelgawad, Peter Klügl, Erdan Genc, Stefan Falkner, Frank Hutter
ECML/PKDD (3)5
2018 Don't Rule Out Simple Models Prematurely: A Large Scale Benchmark Comparing Linear and Non-linear Classifiers in OpenML
Benjamin Strang, Peter van der Putten, Jan N. van Rijn, Frank Hutter
IDA4
2018 Hyperparameter Importance Across Datasets
abstract
With the advent of automated machine learning, automated hyperparameter optimization methods are by now routinely used in data mining. However, this progress is not yet matched by equal progress on automatic analyses that yield information beyond performance-optimizing hyperparameter settings. In this work, we aim to answer the following two questions: Given an algorithm, what are generally its most important hyperparameters, and what are typically good values for these? We present methodology and a framework to answer these questions based on meta-learning across many datasets. We apply this methodology using the experimental meta-data available on OpenML to determine the most important hyperparameters of support vector machines, random forests and Adaboost, and to infer priors for all their hyperparameters. The results, obtained fully automatically, provide a quantitative basis to focus efforts in both manual algorithm design and in automated hyperparameter optimization. The conducted experiments confirm that the hyperparameters selected by the proposed method are indeed the most important ones and that the obtained priors also lead to statistically significant improvements in hyperparameter optimization.
Jan N. van Rijn, Frank Hutter
KDD2
2013 Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms
abstract
Many different machine learning algorithms exist; taking into account each algorithm's hyperparameters, there is a staggeringly large number of possible alternatives overall. We consider the problem of simultaneously selecting a learning algorithm and setting its hyperparameters, going beyond previous work that attacks these issues separately. We show that this problem can be addressed by a fully automated approach, leveraging recent innovations in Bayesian optimization. Specifically, we consider a wide range of feature selection techniques (combining 3 search and 8 evaluator methods) and all classification approaches implemented in WEKA's standard distribution, spanning 2 ensemble methods, 10 meta-methods, 27 base classifiers, and hyperparameter settings for each classifier. On each of 21 popular datasets from the UCI repository, the KDD Cup 09, variants of the MNIST dataset and CIFAR-10, we show classification performance often much better than using standard selection and hyperparameter optimization methods. We hope that our approach will help non-expert users to more effectively identify machine learning algorithms and hyperparameter settings appropriate to their applications, and hence to achieve improved performance.
Chris Thornton, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
KDD2