A reproducible comparative study of categorical kernels for Gaussian process regression, with new clustering-based nested kernels

Designing categorical kernels is a major challenge for Gaussian process regression with continuous and categorical inputs. Despite previous studies, it is difficult to identify a preferred method, either because the evaluation metrics, the optimization procedure, or the datasets change depending on the study. In particular, reproducible code is rarely available. The aim of this paper is to provide a reproducible comparative study of all existing categorical kernels on many of the test cases investigated so far. We also propose new evaluation metrics inspired by the optimization community, which provide quantitative rankings of the methods across several tasks. From our results on datasets which exhibit a group structure on the levels of categorical inputs, it appears that nested kernels methods clearly outperform all competitors. When the group structure is unknown or when there is no prior knowledge of such a structure, we propose a new clustering-based strategy using target encodings of categorical variables. We show that on a large panel of datasets, which do not necessarily have a known group structure, this estimation strategy still outperforms other approaches while maintaining low computational cost.

Authors

Institutions

Publication Details

Journal
ArXiv.org
Published
2025-10-02
Primary Topic
Gaussian Processes and Bayesian Inference
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A reproducible comparative study of categorical kernels for Gaussian process regression, with new clustering-based nested kernels

Josselin Garnier, Sébastien da Veiga, Raphaël Carpintero Perez
ArXiv.org
Gaussian Processes and Bayesian Inference
article

A reproducible comparative study of categorical kernels for Gaussian process regression, with new clustering-based nested kernels

Josselin Garnier, Sébastien da Veiga, Raphaël Carpintero Perez
article en

Abstract

Designing categorical kernels is a major challenge for Gaussian process regression with continuous and categorical inputs. Despite previous studies, it is difficult to identify a preferred method, either because the evaluation metrics, the optimization procedure, or the datasets change depending on the study. In particular, reproducible code is rarely available. The aim of this paper is to provide a reproducible comparative study of all existing categorical kernels on many of the test cases investigated so far. We also propose new evaluation metrics inspired by the optimization community, which provide quantitative rankings of the methods across several tasks. From our results on datasets which exhibit a group structure on the levels of categorical inputs, it appears that nested kernels methods clearly outperform all competitors. When the group structure is unknown or when there is no prior knowledge of such a structure, we propose a new clustering-based strategy using target encodings of categorical variables. We show that on a large panel of datasets, which do not necessarily have a known group structure, this estimation strategy still outperforms other approaches while maintaining low computational cost.

ArXiv.org
École Polytechnique (FR), École Nationale de la Statistique et de l'Analyse de l'Information (FR), Centre de Mathématiques Appliquées de l'École polytechnique (FR), Centre de Recherche en Économie et Statistique (FR), Safran (France) (FR), ENSAE Paris (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 86%
Gaussian Processes and Bayesian Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.