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.
Media services providers, such as music streaming platforms, frequently leverage swipeable carousels to recommend personalized content to their users. However, selecting the most relevant items (albums, artists, playlists...) to display in these carousels is a challenging task, as items are numerous and as users have different preferences. In this paper, we model carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback. We empirically show the effectiveness of our framework at capturing characteristics of real-world carousels by addressing a large-scale playlist recommendation task on a global music streaming mobile app. Along with this paper, we publicly release industrial data from our experiments, as well as an open-source environment to simulate comparable carousel personalization learning problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2009.06546")
get_code_for_paper("2009.06546")
have("2009.06546")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2009.06546.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2009.06546)
Connect an agent — have() is free.