返回
Batch Bayesian optimization via adaptive local search
DOI:10.1007/s10489-020-01790-5.png)
摘要
En 中文
Bayesianoptimization (BO) provides an efficient tool for solving the black-box global optimization problems. Under situations where multiple points can be evaluated simultaneously, batch Bayesian optimization has been a popular extension by taking full use of the computational and experimental resources. In this paper, an adaptive local search strategy is investigated to select batch points for Bayesian optimization. First, multi-start strategy and gradient-based optimization method are combined to maximize the acquisition function. Then, an automatic cluster approach (e.g., X-means) is applied to adaptively identify the acquisition function's local maxima from the gradient-based optimization results. Third, the Bayesian stopping criterion is utilized to guarantee all the local maxima can be obtained theoretically. Moreover, the lower bound confidence criterion and frontend truncation operation are employed to select the most promising local maxima as batch points. Extensive evaluations on various synthetic functions and two hyperparameter tuning problems for deep learning models are utilized to verify the proposed method.
Keyword:
Batch Bayesian optimization
Adaptive local search
Parallel search
Hyperparameter tuning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Decision support system for arrhythmia prediction using convolutional neural network structure without preprocessing
APPLIED INTELLIGENCE
IF3.5
Taking the Human Out of the Loop: A Review of Bayesian Optimization将人类带出循环: 贝叶斯优化的回顾
PROCEEDINGS OF THE IEEE
IF25.9
Gaussian process for predicting CPU utilization and its application to energy efficiency
APPLIED INTELLIGENCE
IF3.5
Gravitational Clustering: A simple, robust and adaptive approach for distributed networks
SIGNAL PROCESSING
IF3.6

