Saved in:
Bibliographic Details
Main Authors: Pu, Mingyu, Wang, Songhao, Wang, Haowei, Ng, Szu Hui
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.02630
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912258082209792
author Pu, Mingyu
Wang, Songhao
Wang, Haowei
Ng, Szu Hui
author_facet Pu, Mingyu
Wang, Songhao
Wang, Haowei
Ng, Szu Hui
contents Gaussian Process (GP) models are widely utilized as surrogate models in scientific and engineering fields. However, standard GP models are limited to continuous variables due to the difficulties in establishing correlation structures for categorical variables. To overcome this limitati on, we introduce WEighted Euclidean distance matrices Gaussian Process (WEGP). WEGP constructs the kernel function for each categorical input by estimating the Euclidean distance matrix (EDM) among all categorical choices of this input. The EDM is represented as a linear combination of several predefined base EDMs, each scaled by a positive weight. The weights, along with other kernel hyperparameters, are inferred using a fully Bayesian framework. We analyze the predictive performance of WEGP theoretically. Numerical experiments validate the accuracy of our GP model, and by WEGP, into Bayesian Optimization (BO), we achieve superior performance on both synthetic and real-world optimization problems.
format Preprint
id arxiv_https___arxiv_org_abs_2503_02630
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Weighted Euclidean Distance Matrices over Mixed Continuous and Categorical Inputs for Gaussian Process Models
Pu, Mingyu
Wang, Songhao
Wang, Haowei
Ng, Szu Hui
Machine Learning
Gaussian Process (GP) models are widely utilized as surrogate models in scientific and engineering fields. However, standard GP models are limited to continuous variables due to the difficulties in establishing correlation structures for categorical variables. To overcome this limitati on, we introduce WEighted Euclidean distance matrices Gaussian Process (WEGP). WEGP constructs the kernel function for each categorical input by estimating the Euclidean distance matrix (EDM) among all categorical choices of this input. The EDM is represented as a linear combination of several predefined base EDMs, each scaled by a positive weight. The weights, along with other kernel hyperparameters, are inferred using a fully Bayesian framework. We analyze the predictive performance of WEGP theoretically. Numerical experiments validate the accuracy of our GP model, and by WEGP, into Bayesian Optimization (BO), we achieve superior performance on both synthetic and real-world optimization problems.
title Weighted Euclidean Distance Matrices over Mixed Continuous and Categorical Inputs for Gaussian Process Models
topic Machine Learning
url https://arxiv.org/abs/2503.02630