Automated Kernel Discovery Towards Understanding High-dimensional Bayesian Optimization
Taeyoung Yun, Woocheol Shin, Inhyuck Song, Jaewoo Lee, Jinkyoo Park

TL;DR
This paper presents Kernel Discovery, an LLM-driven evolutionary framework that automates the design of effective kernels for high-dimensional Bayesian optimization, surpassing existing methods in benchmark performance.
Contribution
It introduces a novel two-stage LLM-based approach for discovering diverse, validated kernels without relying on raw observations or limited composition rules.
Findings
Achieves an average rank of 1.2 out of 17 on five benchmarks.
Outperforms competitive baselines in high-dimensional BO.
Provides analysis of kernels that improve high-dimensional optimization.
Abstract
Gaussian Process (GP) kernels are central to Bayesian optimization (BO), yet designing effective kernels for high-dimensional problems still relies on extensive manual engineering. Existing automated approaches struggle in high dimensions for two bottlenecks: their kernel search space is limited to additions and multiplications of base kernels, and LLM-based approaches require conditioning on raw observations, which becomes infeasible due to context-length limits and the difficulty of extracting meaningful patterns. We introduce \textbf{Kernel Discovery}, a LLM-driven evolutionary framework for high-dimensional BO that searches a broader kernel space beyond predefined composition rules and does not require conditioning on observations. Motivated by the observation that directly prompting an LLM to generate kernel code yields syntactically varied but functionally identical kernels, we…
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.
