High Dimensional Level Set Estimation with Bayesian Neural Network
About
Level Set Estimation (LSE) is an important problem with applications in various fields such as material design, biotechnology, machine operational testing, etc. Existing techniques suffer from the scalability issue, that is, these methods do not work well with high dimensional inputs. This paper proposes novel methods to solve the high dimensional LSE problems using Bayesian Neural Networks. In particular, we consider two types of LSE problems: (1) \textit{explicit} LSE problem where the threshold level is a fixed user-specified value, and, (2) \textit{implicit} LSE problem where the threshold level is defined as a percentage of the (unknown) maximum of the objective function. For each problem, we derive the corresponding theoretic information based acquisition function to sample the data points so as to maximally increase the level set accuracy. Furthermore, we also analyse the theoretical time complexity of our proposed acquisition functions, and suggest a practical methodology to efficiently tune the network hyper-parameters to achieve high model accuracy. Numerical experiments on both synthetic and real-world datasets show that our proposed method can achieve better results compared to existing state-of-the-art approaches.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Level Set Estimation | AA33 | Average Runtime (min)661.4 | 4 | |
| Level Set Estimation | Levy 10-dimensional | Runtime (min)368.2 | 4 | |
| Level Set Estimation | Mazda 74-dimensional | Average Runtime (min)599.8 | 4 | |
| Level Set Estimation | Levy 100-dimensional | Average Runtime (min)1.13e+3 | 4 | |
| Level Set Estimation | Vehicle 124-dimensional | Average Runtime (min)673.2 | 4 | |
| Level Set Estimation | Ackley 200-dimensional | Avg Runtime (min)1.57e+3 | 4 | |
| Level Set Estimation | Trid 1000-dimensional | Average Runtime (min)2.20e+3 | 4 | |
| Level Set Estimation | Rosenbrock 1000-dimensional | Runtime (min)3.87e+3 | 4 |