Bayesian Optimization for Dynamic Problems
About
We propose practical extensions to Bayesian optimization for solving dynamic problems. We model dynamic objective functions using spatiotemporal Gaussian process priors which capture all the instances of the functions over time. Our extensions to Bayesian optimization use the information learnt from this model to guide the tracking of a temporally evolving minimum. By exploiting temporal correlations, the proposed method also determines when to make evaluations, how fast to make those evaluations, and it induces an appropriate budget of steps based on the available information. Lastly, we evaluate our technique on synthetic and real-world problems.
Favour M. Nyikosa, Michael A. Osborne, Stephen J. Roberts• 2018
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Bayesian Optimization | Hartmann d=6 | Relative Batch Instantaneous Regret0.61 | 8 | |
| Bayesian Optimization | Eggholder d+1=2 | Average Regret256.9 | 6 | |
| Bayesian Optimization | Ackley d+1=4 | Average Regret3.63 | 6 | |
| Bayesian Optimization | Shekel d+1=4 | Average Regret2.06 | 6 | |
| Bayesian Optimization | Hartmann3 d+1=3 | Average Regret0.55 | 6 | |
| Bayesian Optimization | Temperature d+1=3 | Average Regret1.21 | 6 | |
| Bayesian Optimization | Rastrigin d+1=5 | Average Regret36.16 | 6 | |
| Bayesian Optimization | Schwefel d+1=4 | Average Regret662.3 | 6 | |
| Bayesian Optimization | StyblinskiTang d+1=4 | Average Regret58.4 | 6 | |
| Bayesian Optimization | Rosenbrock d+1=3 | Average Regret171 | 6 |
Showing 10 of 34 rows