Saved in:
Bibliographic Details
Main Authors: Akimoto, Youhei, Gao, Xilin, Ng, Ze Kai, Morinaga, Daiki
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2504.00491
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913769415770112
author Akimoto, Youhei
Gao, Xilin
Ng, Ze Kai
Morinaga, Daiki
author_facet Akimoto, Youhei
Gao, Xilin
Ng, Ze Kai
Morinaga, Daiki
contents Optimization of mixed categorical-continuous variables is prevalent in real-world applications of black-box optimization. Recently, CatCMA has been proposed as a method for optimizing such variables and has demonstrated success in hyper-parameter optimization problems. However, it encounters challenges when optimizing categorical variables in the presence of interaction between continuous and categorical variables in the objective function. In this paper, we focus on optimizing mixed binary-continuous variables as a special case and identify two types of variable interactions that make the problem particularly challenging for CatCMA. To address these difficulties, we propose two algorithmic components: a warm-starting strategy and a hyper-representation technique. We analyze their theoretical impact on test problems exhibiting these interaction properties. Empirical results demonstrate that the proposed components effectively address the identified challenges, and CatCMA enhanced with these components, named ICatCMA, outperforms the original CatCMA.
format Preprint
id arxiv_https___arxiv_org_abs_2504_00491
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Challenges of Interaction in Optimizing Mixed Categorical-Continuous Variables
Akimoto, Youhei
Gao, Xilin
Ng, Ze Kai
Morinaga, Daiki
Neural and Evolutionary Computing
Optimization of mixed categorical-continuous variables is prevalent in real-world applications of black-box optimization. Recently, CatCMA has been proposed as a method for optimizing such variables and has demonstrated success in hyper-parameter optimization problems. However, it encounters challenges when optimizing categorical variables in the presence of interaction between continuous and categorical variables in the objective function. In this paper, we focus on optimizing mixed binary-continuous variables as a special case and identify two types of variable interactions that make the problem particularly challenging for CatCMA. To address these difficulties, we propose two algorithmic components: a warm-starting strategy and a hyper-representation technique. We analyze their theoretical impact on test problems exhibiting these interaction properties. Empirical results demonstrate that the proposed components effectively address the identified challenges, and CatCMA enhanced with these components, named ICatCMA, outperforms the original CatCMA.
title Challenges of Interaction in Optimizing Mixed Categorical-Continuous Variables
topic Neural and Evolutionary Computing
url https://arxiv.org/abs/2504.00491