Skip to content
Sagan

Paper

Instance-dependent Stochastic Lipschitz bandit

Unreadunread

AI summary

arXiv:2605. 29748v1 Announce Type: new Abstract: We study the Lipschitz bandit problem, where a learner sequentially maximizes an unknown Lipschitz function $f$ over a domain $\mathcal{X} \subset [0,1]^d$ using noisy pointwise evaluations.