2026-09-20T18:49:51Zhttps://cora.ucc.ie/server/oai/request

oai:cora.ucc.ie:10468/113032023-04-04T10:45:14Zcom_10468_388com_10468_5com_10468_227com_10468_2481com_10468_6com_10468_1col_10468_389col_10468_511col_10468_5231col_10468_8983

openaccess O'Sullivan, Barry Brown, Kenneth Fitzgerald, Tadhg Science Foundation Ireland European Regional Development Fund 2021-05-13T09:07:30Z 2021-05-13T09:07:30Z 2021-04 2021-04 This dissertation presents a number of contributions to the field of algorithm configur- ation. In particular, we present an extension to the algorithm configuration problem, real-time algorithm configuration, where configuration occurs online on a stream of instances, without the need for prior training, and problem solutions are returned in the shortest time possible. We propose a framework for solving the real-time algorithm configuration problem, ReACT. With ReACT we demonstrate that by using the parallel computing architectures, commonplace in many systems today, and a robust aggregate ranking system, configuration can occur without any impact on performance from the perspective of the user. This is achieved by means of a racing procedure. We show two concrete instantiations of the framework, and show them to be on a par with or even exceed the state-of-the-art in offline algorithm configuration using empirical evaluations on a range of combinatorial problems from the literature. We discuss, assess, and provide justification for each of the components used in our framework instantiations. Specifically, we show that the TrueSkill ranking system commonly used to rank players’ skill in multiplayer games can be used to accurately es- timate the quality of an algorithm’s configuration using only censored results from races between algorithm configurations. We confirm that the order that problem instances arrive in influences the configuration performance and that the optimal selection of configurations to participate in races is dependent on the distribution of the incoming in- stance stream. We outline how to maintain a pool of quality configurations by removing underperforming configurations, and techniques to generate replacement configurations with minimal computational overhead. Finally, we show that the configuration space can be reduced using feature selection techniques from the machine learning literature, and that doing so can provide a boost in configuration performance. Not peer reviewed Accepted Version application/pdf Fitzgerald, T. 2021. Real-time algorithm configuration. PhD Thesis, University College Cork. 205 https://hdl.handle.net/10468/11303 en University College Cork info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ © 2021, Tadhg Fitzgerald. https://creativecommons.org/licenses/by-nc-nd/4.0/ Optimisation Algorithm configuration Real-time algorithm configuration Doctoral thesis Doctoral PhD - Doctor of Philosophyinfo:eu-repo/semantics/openAccess