Timezone: »

Lipschitz Bandits with Batched Feedback
Yasong Feng · zengfeng Huang · Tianyu Wang

Tue Dec 06 05:00 PM -- 07:00 PM (PST) @
In this paper, we study Lipschitz bandit problems with batched feedback, where the expected reward is Lipschitz and the reward observations are communicated to the player in batches. We introduce a novel landscape-aware algorithm, called Batched Lipschitz Narrowing (BLiN), that optimally solves this problem. Specifically, we show that for a $T$-step problem with Lipschitz reward of zooming dimension $d_z$, our algorithm achieves theoretically optimal (up to logarithmic factors) regret rate $\widetilde{\mathcal{O}}\left(T^{\frac{d_z+1}{d_z+2}}\right)$ using only $ \mathcal{O} \left( \log\log T\right) $ batches. We also provide complexity analysis for this problem. Our theoretical lower bound implies that $\Omega(\log\log T)$ batches are necessary for any algorithm to achieve the optimal regret. Thus, BLiN achieves optimal regret rate using minimal communication.

Author Information

Yasong Feng (Fudan University)
zengfeng Huang (Fudan University)
Tianyu Wang (Fudan University)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors