1 citations · 1 across the 3 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations
Carlos Ansotegui, Meinolf Sellmann, Tapan Shah +1
We consider black-box optimization in which only an extremely limited number of function evaluations, on the order of around 100, are affordable and the function evaluations must b…
cs.LG2020
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection
Meinolf Sellmann, Tapan Shah
We consider the dynamic classifier selection (DCS) problem: Given an ensemble of classifiers, we are to choose which classifier to use depending on the particular input vector that…