2 papers
cs.NE2026
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
Jasmin Brandt, Barbara Hammer, Timo Kötzing +1
We consider the classic Multi-Armed Bandit setting to understand the exploration/exploitation tradeoffs made by different search heuristics. Since many search heuristics work by co…
cs.NE2026
Anytime Analysis on BinVal: Adaptive Parameters Help
Timo Kötzing, Jurek Sander
While most theoretical run time analyses of discrete randomized search heuristics provide bounds on the expected number of evaluations to find the global optimum, we consider the a…