Mykola Pechenizkiy, Danil Provodin, Pratik Gajane, Maurits Kaptein
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We consider a special case of bandit problems, namely batched bandits. Motivated by natural restrictions of recommender systems and e-commerce platforms, we assume that a learning agent observes responses batched in groups over a certain time period. Unlike previous work, we consider a more practically relevant batchcentric scenario of batch learning. We provide a policy-agnostic regret analysis and demonstrate upper and lower bounds for the regret of a candidate policy. Our main theoretical results show that the impact of batch learning can be measured in terms of online behavior. Finally, we demonstrate the consistency of theoretical results by conducting empirical experiments and reflect on the optimal batch size choice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2111.02071")
get_code_for_paper("2111.02071")
have("2111.02071")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2111.02071.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2111.02071)
Connect an agent — have() is free.