Batched Kernelized Bandits: Refinements and Extensions
Chenkai Ma, Keqin Chen, Jonathan Scarlett

TL;DR
This paper refines regret bounds for batched kernelized bandit algorithms, determines optimal batch numbers, introduces adaptive batch lower bounds, and extends the framework to robust optimization against adversarial perturbations.
Contribution
It provides the optimal number of batches for near-optimal regret, introduces adaptive batch lower bounds, and proposes a robust algorithm with improved regret bounds.
Findings
Optimal batch number refined to within 1+o(1) factors.
Adaptive batch sizes have similar minimax regret as fixed sizes.
Robust-BPE algorithm achieves regret bounds comparable to non-robust setting.
Abstract
In this paper, we consider the problem of black-box optimization with noisy feedback revealed in batches, where the unknown function to optimize has a bounded norm in some Reproducing Kernel Hilbert Space (RKHS). We refer to this as the Batched Kernelized Bandits problem, and refine and extend existing results on regret bounds. For algorithmic upper bounds, (Li and Scarlett, 2022) shows that batches suffice to attain near-optimal regret, where is the time horizon and is the number of batches. We further refine this by (i) finding the optimal number of batches including constant factors (to within ), and (ii) removing a factor of in the regret bound. For algorithm-independent lower bounds, noticing that existing results only apply when the batch sizes are fixed in advance, we present novel lower bounds when the batch sizes are chosen adaptively, and…
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 · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
