mlsanityData to 14 Oct 2026

Event-Triggered Time-Varying Bayesian Optimization

arXiv 2208.10790 ↗First posted 23 Aug 2022cs.LG stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

We consider the problem of sequentially optimizing a time-varying objective function using time-varying Bayesian optimization (TVBO). Current approaches to TVBO require prior knowledge of a constant rate of change to cope with stale data arising from time variations. However, in practice, the rate of change is usually unknown. We propose an event-triggered algorithm, ET-GP-UCB, that treats the optimization problem as static until it detects changes in the objective function and then resets the dataset. This allows the algorithm to adapt online to realized temporal changes without the need for exact prior knowledge. The event trigger is based on probabilistic uniform error bounds used in Gaussian process regression. We derive regret bounds for adaptive resets without exact prior knowledge of the temporal changes and show in numerical experiments that ET-GP-UCB outperforms competing GP-UCB algorithms on both synthetic and real-world data. The results demonstrate that ET-GP-UCB is readily applicable without extensive hyperparameter tuning.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 24 of its 63 references that are in the map. First posted on arXiv 23 Aug 2022.

Builds on

24 of 63 references.

References · 24

  1. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 609
  2. 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
  3. 2017On Kernelized Multi-armed Banditscited by 352
  4. 2013Non-stationary Stochastic Optimizationcited by 175
  5. 2021Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approachcited by 98
  6. 2015Bayesian optimization for materials designcited by 80
  7. 2019A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-freecited by 71
  8. 2020Provably Efficient Online Hyperparameter Optimization with Population-Based Banditscited by 63
  9. 2018Bayesian Optimization in AlphaGocited by 55
  10. 2016Time-Varying Gaussian Process Bandit Optimizationcited by 50
  11. 2021Local policy search with Bayesian optimizationcited by 38
  12. 2020Minimizing Dynamic Regret and Adaptive Regret Simultaneouslycited by 31
12 more
  1. 2020Time-Varying Convex Optimization: Time-Structured Algorithms and Applicationscited by 31
  2. 2021Weighted Gaussian Process Bandits for Non-stationary Environmentscited by 30
  3. 2022A New Look at Dynamic Regret for Non-Stationary Stochastic Banditscited by 28
  4. 2021Tracking Most Significant Arm Switches in Banditscited by 27
  5. 2019Feedback Linearization based on Gaussian Processes with event-triggered Online Learningcited by 24
  6. 2021No-Regret Algorithms for Time-Varying Bayesian Optimizationcited by 19
  7. 2018Data-efficient Auto-tuning with Bayesian Optimization: An Industrial Control Studycited by 15
  8. 2022On Controller Tuning with Time-Varying Bayesian Optimizationcited by 13
  9. 2021Safe and Efficient Model-free Adaptive Control via Bayesian Optimizationcited by 10
  10. 2019Event-triggered Learningcited by 9
  11. 2021Tuning Mixed Input Hyperparameters on the Fly for Efficient Population Based AutoRLcited by 8
  12. 2018Online Optimization as a Feedback Controller: Stability and Trackingcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 2; 2026: 2.

7 papers.