Dehb: Evolutionary hyperband for scalable, robust and efficient hyperparameter optimization

N Awad, N Mallik, F Hutter - arXiv preprint arXiv:2105.09821, 2021 - arxiv.org
Modern machine learning algorithms crucially rely on several design decisions to achieve
strong performance, making the problem of Hyperparameter Optimization (HPO) more …

Exploratory landscape analysis is strongly sensitive to the sampling strategy

Q Renau, C Doerr, J Dreo, B Doerr - … Solving from Nature–PPSN XVI: 16th …, 2020 - Springer
Exploratory landscape analysis (ELA) supports supervised learning approaches for
automated algorithm selection and configuration by providing sets of features that quantify …

Black-box optimization revisited: Improving algorithm selection wizards through massive benchmarking

L Meunier, H Rakotoarison, PK Wong… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
Existing studies in black-box optimization suffer from low generalizability, caused by a
typically selective choice of problem instances used for training and testing of different …

Engineering knowledge for automated planning: Towards a notion of quality

TL McCluskey, TS Vaquero, M Vallati - Proceedings of the 9th …, 2017 - dl.acm.org
Automated planning is a prominent Artificial Intelligence challenge, as well as being a
common capability requirement for intelligent autonomous agents. A critical aspect of what is …

What you always wanted to know about the deterministic part of the international planning competition (IPC) 2014 (but were too afraid to ask)

M Vallati, L Chrpa, TL Mccluskey - The Knowledge Engineering …, 2018 - cambridge.org
The International Planning Competition (IPC) is a prominent event of the artificial
intelligence planning community that has been organized since 1998; it aims at fostering the …

Tie-breaking strategies for cost-optimal best first search

M Asai, A Fukunaga - Journal of Artificial Intelligence Research, 2017 - jair.org
Best-first search algorithms such as A* need to apply tie-breaking strategies in order to
decide which node to expand when multiple search nodes have the same evaluation score …

Tiebreaking strategies for A* search: How to explore the final frontier

M Asai, A Fukunaga - Proceedings of the AAAI Conference on Artificial …, 2016 - ojs.aaai.org
Despite recent improvements in search techniques for cost-optimal classical planning, the
exponential growth of the size of the search frontier in A* is unavoidable. We investigate …

On the robustness of domain-independent planning engines: the impact of poorly-engineered knowledge

M Vallati, L Chrpa - Proceedings of the 10th International Conference on …, 2019 - dl.acm.org
Recent advances in automated planning are leading towards the use of planning engines in
a wide range of real-world applications. As the exploitation of planning techniques in …

Competitions in AI--Robustly Ranking Solvers Using Statistical Resampling

C Fawcett, M Vallati, HH Hoos, AE Gerevini - arXiv preprint arXiv …, 2023 - arxiv.org
Solver competitions play a prominent role in assessing and advancing the state of the art for
solving many problems in AI and beyond. Notably, in many areas of AI, competitions have …

Synthesis of domain specific CNF encoders for bit-vector solvers

JP Inala, R Singh, A Solar-Lezama - … , Bordeaux, France, July 5-8, 2016 …, 2016 - Springer
The theory of bit-vectors in SMT solvers is very important for many applications due to its
ability to faithfully model the behavior of machine instructions. A crucial step in solving bit …