A Batched Scalable Multi-Objective Bayesian Optimization Algorithm
arXiv:1811.01323
Abstract
The surrogate-assisted optimization algorithm is a promising approach for solving expensive multi-objective optimization problems. However, most existing surrogate-assisted multi-objective optimization algorithms have three main drawbacks: 1) cannot scale well for solving problems with high dimensional decision space, 2) cannot incorporate available gradient information, and 3) do not support batch optimization. These drawbacks prevent their use for solving many real-world large scale optimization problems. This paper proposes a batched scalable multi-objective Bayesian optimization algorithm to tackle these issues. The proposed algorithm uses the Bayesian neural network as the scalable surrogate model. Powered with Monte Carlo dropout and Sobolov training, the model can be easily trained and can incorporate available gradient information. We also propose a novel batch hypervolume upper confidence bound acquisition function to support batch optimization. Experimental results on various benchmark problems and a real-world application demonstrate the efficiency of the proposed algorithm.
References in corpus (9)
- Improving neural networks by preventing co-adaptation of feature detectors
- Neural Architecture Search with Reinforcement Learning
- Weight Uncertainty in Neural Networks
- Deep Neural Networks as Gaussian Processes
- Gradient-based Hyperparameter Optimization through Reversible Learning
- A Bayesian approach to constrained single- and multi-objective optimization
- Bayesian Optimization with Gradients
- Exploiting gradients and Hessians in Bayesian optimization and Bayesian quadrature
- DrMAD: Distilling Reverse-Mode Automatic Differentiation for Optimizing Hyperparameters of Deep Neural Networks