2026
Practical, Utilitarian Algorithm Configuration
AAAI 2026technical
Utilitarian algorithm configuration identifies a parameter setting for a given algorithm that maximizes a user
4 accepted papers
Utilitarian algorithm configuration identifies a parameter setting for a given algorithm that maximizes a user
Utilitarian algorithm configuration is a general-purpose technique for automatically searching the parameter space of a given algorithm to optimize its performance, as measured by a given utility function, on a given set of inputs. Recently introduced utilitarian configuration procedures offer optim…
When trying to solve a computational problem, we are often faced with a choice between algorithms that are guaranteed to return the right answer but differ in their runtime distributions (e.g., SAT solvers, sorting algorithms). This paper aims to lay theoretical foundations for such choices by forma…
We present the first nontrivial procedure for configuring heuristic algorithms to maximize the utility provided to their end users while also offering theoretical guarantees about performance. Existing procedures seek configurations that minimize expected runtime. However, very recent theoretical wo…