Author Archives: André Biedenkapp

Learning Step-Size Adaptation in CMA-ES

In a Nutshell In CMA-ES, the step size controls how fast or slow a population traverses through a search space. Large steps allow you to quickly skip over uninteresting areas (exploration), whereas small steps allow a more focused traversal of interesting areas (exploitation). Handcrafted heuristics usually trade off small and large steps given some measure […]

Read More


Dynamic Algorithm Configuration

  Motivation When designing algorithms we want them to be as flexible as possible such that they can solve as many problems as possible. To solve a specific family of problems well, finding well-performing hyperparameter configurations requires us to either use extensive domain knowledge or resources. The second point is especially true if we want […]

Read More

PoSH Auto-sklearn

We did it again: world champions in AutoML

By André Biedenkapp, Katharina Eggensperger, Matthias Feurer, Frank Hutter Our ML Freiburg lab is the world champion in automatic machine learning (AutoML) again! After winning the first international AutoML challenge (2015-2016), we also just won the second international AutoML challenge (2017-2018). Our system PoSH-Auto-sklearn outperformed all other 41 participating AutoML systems. What is AutoML and […]

Read More