12 citations · 14 across the 3 of their papers we have counts for
3 papers
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…
Investigating the Impact of Independent Rule Fitnesses in a Learning Classifier System
Michael Heider, Helena Stegherr, Jonathan Wurth +2
Achieving at least some level of explainability requires complex analyses for many machine learning systems, such as common black-box models. We recently proposed a new rule-based…
Separating Rule Discovery and Global Solution Composition in a Learning Classifier System
Michael Heider, Helena Stegherr, Jonathan Wurth +2
While utilization of digital agents to support crucial decision making is increasing, trust in suggestions made by these agents is hard to achieve. However, it is essential to prof…