Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently
Kenshin Abe, Yunzhuo Wang, Shuhei Watanabe

TL;DR
This paper introduces an efficient TPE-based algorithm for black-box combinatorial optimization, extending TPE's applicability beyond deep learning to domains like chemistry and biology, with improved solution quality and evaluation efficiency.
Contribution
The paper generalizes the TPE kernel to handle combinatorial spaces and proposes modifications that reduce computational complexity, enabling more effective optimization in larger search spaces.
Findings
Proposed method finds better solutions with fewer evaluations.
Kernel modifications reduce time complexity for large search spaces.
Algorithm is implemented in the open-source Optuna framework.
Abstract
Tree-structured Parzen estimator (TPE) is a versatile hyperparameter optimization (HPO) method supported by popular HPO tools. Since these HPO tools have been developed in line with the trend of deep learning (DL), the problem setups often used in the DL domain have been discussed for TPE such as multi-objective optimization and multi-fidelity optimization. However, the practical applications of HPO are not limited to DL, and black-box combinatorial optimization is actively utilized in some domains, e.g., chemistry and biology. As combinatorial optimization has been an untouched, yet very important, topic in TPE, we propose an efficient combinatorial optimization algorithm for TPE. In this paper, we first generalize the categorical kernel with the numerical kernel in TPE, enabling us to introduce a distance structure to the categorical kernel. Then we discuss modifications for the newly…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Constraint Satisfaction and Optimization
