Daily Arxiv

This page organizes papers related to artificial intelligence published around the world.
This page is summarized using Google Gemini and is operated on a non-profit basis.
The copyright of the paper belongs to the author and the relevant institution. When sharing, simply cite the source.

Adaptive Kernel Design for Bayesian Optimization Is a Piece of CAKE with LLMs

Created by
  • Haebom

Author

Richard Cornelius Suwandi, Feng Yin, Juntao Wang, Renjie Li, Tsung-Hui Chang, Sergios Theodoridis

Outline

This paper proposes CAKE (Context-Aware Kernel Evolution), a novel method that leverages large-scale language models (LLMs) to improve the efficiency of Bayesian Optimization (BO). While existing BOs rely on fixed or heuristic kernel selection strategies, which can lead to suboptimal solutions, CAKE adaptively generates and improves GP kernels based on observed data using LLMs. Furthermore, we propose BAKER (BIC-Acquisition Kernel Ranking), a method that selects the most effective kernels by considering the Bayesian Information Criterion (BIC) and the expected improvement. Experimental results demonstrate that CAKE-based BO outperforms existing methods in a variety of real-world problems, including hyperparameter optimization, controller tuning, and photonic chip design.

Takeaways, Limitations

Takeaways:
We present a novel method for dynamically generating and improving BO's GP kernel using LLM.
An efficient kernel selection strategy considering BIC and expected improvement is presented.
Demonstrated superior performance compared to existing methods in various real-world problems
Reproducibility achieved through open source code
Limitations:
May depend on LLM performance. If LLM performance degrades, CAKE performance may also degrade.
Further research is needed to determine how to optimally balance BIC and expected improvement.
Performance may be limited for certain types of problems. More extensive experimentation is needed.
👍