Learning to Optimize under Non-StationarityDownload PDFOpen Website

2019 (modified: 24 Apr 2023)AISTATS 2019Readers: Everyone
Abstract: We introduce algorithms that achieve state-of-the-art dynamic regret bounds for non-stationary linear stochastic bandit setting. It captures natural applications such as dynamic pricing and ads all...
0 Replies

Loading