Skip to content
Sagan

Paper

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates

Unreadunread

AI summary

arXiv:2606. 00984v1 Announce Type: new Abstract: We study linear contextual bandits under rare parameter updates: the learner may incorporate reward feedback into its parameter estimate only at a small number of update times, while still observing contexts online and selecting actions sequentially.