Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

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

TaskDatasetResultRank
Bayesian OptimizationHartmann d=6
Relative Batch Instantaneous Regret0.61
8
Bayesian OptimizationEggholder d+1=2
Average Regret256.9
6
Bayesian OptimizationAckley d+1=4
Average Regret3.63
6
Bayesian OptimizationShekel d+1=4
Average Regret2.06
6
Bayesian OptimizationHartmann3 d+1=3
Average Regret0.55
6
Bayesian OptimizationTemperature d+1=3
Average Regret1.21
6
Bayesian OptimizationRastrigin d+1=5
Average Regret36.16
6
Bayesian OptimizationSchwefel d+1=4
Average Regret662.3
6
Bayesian OptimizationStyblinskiTang d+1=4
Average Regret58.4
6
Bayesian OptimizationRosenbrock d+1=3
Average Regret171
6
Showing 10 of 34 rows

Other info

Follow for update