Pareto-Optimal Anytime Algorithms via Bayesian Racing

Jonathan Wurth, Helena Stegherr, Neele Kemper +2

Selecting an optimization algorithm requires comparing candidates across problem instances, but the computational budget for deployment is often unknown at benchmarking time. Curre…