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
arXiv:2607. 14192v1 Announce Type: new Abstract: As recommender systems mature in the past few years, their optimization objectives have evolved from a primary focusing on short-term behavioral signals to a broader emphasis on long-term user engagement and retention.
By Dingsu Wang, Filip Ryzner, Kelly He, Armando Ordorica, David Woo, Aditya Mantha, Liyao Lu, Usha Amrutha Nookala, Haoran Guo, Jiacong He, Olafur Gudmundsson, Matt Chun, Krystal Benitez, Dhruvil Deven Badani, Yijie Dylan Wang
arXiv:2608. 06750v1 Announce Type: cross Abstract: Iterative refinement has significantly enhanced Large Language Model (LLM) performance; however, existing methods ranging from feedback-based Self-Refine to traditional bandit approaches often rely on static options or overlook the saturation effect.
By Shion Ishikawa, Pablo Loyola, Young-joo Chung, Yun Ching Liu
arXiv:2606. 08410v1 Announce Type: cross Abstract: Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives.
By Linfeng Cao, Ming Shi, Ness B. Shroff
arXiv:2602. 23565v2 Announce Type: replace Abstract: In many economically relevant contexts where machine learning is deployed, multiple platforms obtain data from the same pool of users, each of whom selects the platform that best serves them.
By Adhyyan Narang, Sarah Dean, Lillian J Ratliff, Maryam Fazel
arXiv:2608. 16707v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly deployed as decision-making agents in settings that require sophisticated environmental exploration.
By David Eric Austin, Kaheer Suleman, Jackie Chi Kit Cheung
arXiv:2606. 14929v1 Announce Type: cross Abstract: Modern recommendation systems increasingly rely on dynamically routing diverse queries to multiple embedding models.
By Yan Dai, Negin Golrezaei, Patrick Jaillet