Repository logo
  • Log In
    Log in via Symplectic to deposit your publication(s).
Repository logo
  • Communities & Collections
  • Research Outputs
  • Statistics
  • Log In
    Log in via Symplectic to deposit your publication(s).
  1. Home
  2. Faculty of Engineering
  3. Computing
  4. Computing PhD theses
  5. Sequential black-box optimization via global optimization of tree ensembles
 
  • Details
Sequential black-box optimization via global optimization of tree ensembles
File(s)
Thebelt-A-2023-PhD-Thesis.pdf (8.99 MB)
Thesis
Author(s)
Thebelt, Alexander
Type
Thesis or dissertation
Abstract
This thesis explores the integration of tree ensembles with global optimization methods for addressing complex black-box optimization problems across various real-world applications, including chemical engineering, energy systems, and hyperparameter optimization.

ENTMOOT, a novel software framework, integrates tree models effectively into decision-making and black-box optimization tasks.
The framework introduces a reliable uncertainty measure compatible with tree models, and proposes and evaluates strategies for tackling large-scale optimization problems, thereby addressing some common limitations of tree-based models in Bayesian optimization.
Further, it ensures globally optimal solutions of acquisition functions to facilitate ideal trade-offs when proposing new black-box experiments.

Moreover, we extend ENTMOOT for constrained multi-objective optimization of black-box problems and apply it to relevant problems related to energy systems.
This strategy proves preferable compared to evolutionary-based algorithms deployed in this field, especially when dealing with heterogeneous variable spaces and complex or unknown system dynamics that involve input constraints.

Continuing on this trajectory, we further develop the research to confront challenges inherent to the application of tree ensembles in black-box optimization tasks, such as algorithm tuning and neural architecture search.
By leveraging the kernel interpretation of tree ensembles as a Gaussian Process prior, we obtain model variance estimates and develop a compatible optimization formulation for the piece-wise constant acquisition function compatible with deterministic global solvers.
Importantly, this approach allows for the seamless integration of known constraints, thereby improving sampling efficiency across scenarios involving mixed-variable feature spaces and known input constraints.

The presented research offers comprehensive insights and innovative strategies to tap into the strengths of tree ensembles while mitigating some of their limitations, ultimately advocating their increased applicability across a spectrum of real-world optimization scenarios.
Version
Open Access
Date Issued
2023-08
Date Awarded
2024-06
URI
http://hdl.handle.net/10044/1/113203
DOI
https://doi.org/10.25560/113203
Copyright Statement
Creative Commons Attribution NonCommercial Licence
License URL
http://creativecommons.org/licenses/by-nc/4.0/
Advisor
Misener, Ruth
Publisher Department
Computing
Publisher Institution
Imperial College London
Qualification Level
Doctoral
Qualification Name
Doctor of Philosophy (PhD)
About
Spiral Depositing with Spiral Publishing with Spiral Symplectic
Contact us
Open access team Report an issue
Other Services
Scholarly Communications Library Services
logo

Imperial College London

South Kensington Campus

London SW7 2AZ, UK

tel: +44 (0)20 7589 5111

Accessibility Modern slavery statement Cookie Policy

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback