Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems
Evolutionary Computation · 01.12.2023 · 31 (4) · 375-399
DOI: 10.1162/evco_a_00329 ↗Kurz gefasst
Fachartikel in der Zeitschrift Evolutionary Computation, online erschienen am 01.12.2023. Verfasst von Atanu Mazumdar und 4 weiteren Autor:innen. Beteiligte Einrichtung: University of Jyvaskyla, Faculty of Information Technology, Finland atanu.a.mazumdar@jyu.fi. Hauptthemen laut MEDLINE: Algorithms, Biological Evolution. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
For offline data-driven multiobjective optimization problems (MOPs), no new data is available during the optimization process. Approximation models (or surrogates) are first built using the provided offline data, and an optimizer, for example, a multiobjective evolutionary algorithm, can then be utilized to find Pareto optimal solutions to the problem with surrogates as objective functions. In contrast to online data-driven MOPs, these surrogates cannot be updated with new data and, hence, the approximation accuracy cannot be improved by considering new data during the optimization process. Gaussian process regression (GPR) models are widely used as surrogates because of their ability to provide uncertainty information. However, building GPRs becomes computationally expensive when the size of the dataset is large. Using sparse GPRs reduces the computational cost of building the surrogates. However, sparse GPRs are not tailored to solve offline data-driven MOPs, where good accuracy of the surrogates is needed near Pareto optimal solutions. Treed GPR (TGPR-MO) surrogates for offline data-driven MOPs with continuous decision variables are proposed in this paper. The proposed surrogates first split the decision space into subregions using regression trees and build GPRs sequentially in regions close to Pareto optimal solutions in the decision space to accurately approximate tradeoffs between the objective functions. TGPR-MO surrogates are computationally inexpensive because GPRs are built only in a smaller region of the decision space utilizing a subset of the data. The TGPR-MO surrogates were tested on distance-based visualizable problems with various data sizes, sampling strategies, numbers of objective functions, and decision variables. Experimental results showed that the TGPR-MO surrogates are computationally cheaper and can handle datasets of large size. Furthermore, TGPR-MO surrogates produced solutions closer to Pareto optimal solutions compared to full GPRs and sparse GPRs.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Autor:innen und Institutionen
- University of Jyvaskyla, Faculty of Information Technology, Finland atanu.a.mazumdar@jyu.fi.
- Alliance Manchester Business School, University of Manchester, UK manuel.lopez-ibanez@manchester.ac.uk.
- Department of Computer Science, University of Exeter, UK t.chugh@exeter.ac.uk.
- University of Jyvaskyla, Faculty of Information Technology, Finland jussi.hakanen@jyu.fi.
- University of Jyvaskyla, Faculty of Information Technology, Finland kaisa.miettinen@jyu.fi.
Zitieren
APA
Mazumdar, A., López-Ibáñez, M., Chugh, T., Hakanen, J., & Miettinen, K. (2023). Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems. Evolutionary Computation, 31(4), 375-399. https://doi.org/10.1162/evco_a_00329
Vancouver
Mazumdar A, López-Ibáñez M, Chugh T, Hakanen J, Miettinen K. Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems. Evolutionary Computation. 2023;31(4):375-399. doi:10.1162/evco_a_00329
BibTeX
@article{Mazumdar2023,
author = {Mazumdar, Atanu and López-Ibáñez, Manuel and Chugh, Tinkle and Hakanen, Jussi and Miettinen, Kaisa},
title = {Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems},
journal = {Evolutionary Computation},
year = {2023},
volume = {31},
number = {4},
pages = {375--399},
doi = {10.1162/evco_a_00329}
}
EUVIMED