arXiv:2510. 19119v2 Announce Type: replace Abstract: In networked environments, it is common for users to share recommendations about content, products, services, and possible courses of action.
By Ahmed Sayeed Faruk, Mohammad Shahverdikondori, Elena Zheleva
arXiv:2501. 07761v2 Announce Type: replace-cross Abstract: Increasingly, recommender systems are tasked with improving users' long-term satisfaction.
By Kelly W. Zhang, Thomas Baldwin-McDonald, Kamil Ciosek, Lucas Maystre, Daniel Russo
arXiv:2607. 09015v1 Announce Type: cross Abstract: We study contextual bandit problems with correlated arms and access to surrogate reward signals produced by a machine learning model, motivated by applications such as large language model (LLM) routing.
By Ajay Narayanan Sridhar, Ronak Singh, Mehrdad Mahdavi, Vijaykrishnan Narayanan
arXiv:2609.37800v1 Announce Type: cross
Abstract: Many recommender services repeatedly encounter cold-start cohorts, where new users arrive with little or no interaction history. This creates two cha...
By Serafima Lebedeva, Sumantrak Mukherjee, Ali Arshad Sadal, Ilias Ek\c{s}i, Rahul Sharma, Julia Mueller, Theresa Dombrowski, Jakob Karolus, Viktor Bengs, Eyke H\"ullermeier, Sebastian Vollmer
The paper introduces Contextual Scalarisation Thompson Sampler (CSTS), a multi‑objective contextual bandit algorithm that learns to weight competing objectives based on observed context. It addresses the need for adaptable decision‑making in public media, where goals such as audience reach, cultural values, and operational constraints must be balanced. Experiments on Radio Télévision Suisse data demonstrate that CSTS improves contextual relevance and aligns more closely with expert curation than fixed‑weight or standard bandit methods.
By Th\'eo Ma\"etz, Luc Guillet, Andrea Cavallaro
arXiv:2608. 03382v1 Announce Type: cross Abstract: Multi-armed bandit algorithms, especially Thompson sampling, are widely used in online recommendation.
By Eugene Lee, Oseong Choi, Byungsoo Kang, Taeyeong Jang