No-Regret Gaussian Process Optimization of Time-Varying Functions
Eliabelle Mauduit, Elo\"ise Berthier, Andrea Simonetto

TL;DR
This paper introduces a novel Gaussian Process-based method for optimizing time-varying functions, achieving no-regret with minimal additional queries by leveraging uncertainty injection and heteroscedastic regression.
Contribution
It proposes W-SparQ-GP-UCB, an online algorithm that attains no-regret in time-varying settings with few extra queries, and establishes theoretical bounds on query complexity.
Findings
Achieves no-regret with vanishing additional queries.
Provides lower bounds on the number of extra queries needed.
Links time-variation degree to regret rates.
Abstract
Sequential optimization of black-box functions from noisy evaluations has been widely studied, with Gaussian Process bandit algorithms such as GP-UCB guaranteeing no-regret in stationary settings. However, for time-varying objectives, it is known that no-regret is unattainable under pure bandit feedback unless strong and often unrealistic assumptions are imposed. In this article, we propose a novel method to optimize time-varying rewards in the frequentist setting, where the objective has bounded RKHS norm. Time variations are captured through uncertainty injection (UI), which enables heteroscedastic GP regression that adapts past observations to the current time step. As no-regret is unattainable in general in the strict bandit setting, we relax the latter allowing additional queries on previously observed points. Building on sparse inference and the effect of UI on regret, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Gaussian Processes and Bayesian Inference · Stochastic Gradient Optimization Techniques
