TL;DR
CatCMA is a novel stochastic optimization algorithm designed for mixed-category black-box problems, combining Gaussian and categorical distributions with natural gradient updates to improve scalability and robustness.
Contribution
It introduces a joint distribution approach with acceleration techniques for efficient high-dimensional mixed-variable optimization.
Findings
Outperforms state-of-the-art Bayesian optimization methods
Demonstrates robustness across various problem dimensions
Shows superior convergence and efficiency in numerical experiments
Abstract
Black-box optimization problems often require simultaneously optimizing different types of variables, such as continuous, integer, and categorical variables. Unlike integer variables, categorical variables do not necessarily have a meaningful order, and the discretization approach of continuous variables does not work well. Although several Bayesian optimization methods can deal with mixed-category black-box optimization (MC-BBO), they suffer from a lack of scalability to high-dimensional problems and internal computational cost. This paper proposes CatCMA, a stochastic optimization method for MC-BBO problems, which employs the joint probability distribution of multivariate Gaussian and categorical distributions as the search distribution. CatCMA updates the parameters of the joint probability distribution in the natural gradient direction. CatCMA also incorporates the acceleration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
