A Quadrature Approach for General-Purpose Batch Bayesian Optimization via Probabilistic Lifting
원문 초록
Parallelisation in Bayesian optimisation is a common strategy but faces several challenges: the need for flexibility in acquisition functions and kernel choices, flexibility dealing with discrete and continuous variables simultaneously, model misspecification, and lastly fast massive parallelisation. To address these challenges, we introduce a versatile and modular framework for batch Bayesian optimisation via probabilistic lifting with kernel quadrature, called SOBER, which we present as a Python library based on GPyTorch/BoTorch. Our framework offers the following unique benefits: (1) Versatility in downstream tasks under a unified approach. (2) A gradient-free sampler, which does not require the gradient of acquisition functions, offering domain-agnostic sampling (e.g., discrete and mixed variables, non-Euclidean space). (3) Flexibility in domain prior distribution. (4) Adaptive batch size (autonomous determination of the optimal batch size). (5) Robustness against a misspecified reproducing kernel Hilbert space. (6) Natural stopping criterion.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
Few-shot crack image classification using clip based on bayesian optimization
Graph Agnostic Causal Bayesian Optimisation
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
Reinforcement Learning Increases Wind Farm Power Production by Enabling Closed-Loop Collaborative Control
Fast Bayesian Optimization of Function Networks with Partial Evaluations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.