中文
相关论文

相关论文: Diversified Recommendations for Agents with Adapti…

200 篇论文

In digital health and EdTech, recommendation systems face a significant challenge: users often choose impulsively, in ways that conflict with the platform's long-term payoffs. This misalignment makes it difficult to effectively learn to…

机器学习 · 计算机科学 2024-02-22 Arpit Agarwal , Rad Niazadeh , Prathamesh Patil

Users on e-commerce platforms can be uncertain about their preferences early in their search. Queries to recommendation systems are frequently ambiguous, incomplete, or weakly specified. Agentic systems are expected to proactively reason,…

人工智能 · 计算机科学 2026-03-13 Dat Tran , Yongce Li , Hannah Clay , Negin Golrezaei , Sajjad Beygi , Amin Saberi

Recommendation systems when employed in markets play a dual role: they assist users in selecting their most desired items from a large pool and they help in allocating a limited number of items to the users who desire them the most. Despite…

机器学习 · 计算机科学 2022-08-01 Yigit Efe Erginbas , Soham Phade , Kannan Ramchandran

Increasingly, recommender systems are tasked with improving users' long-term satisfaction. In this context, we study a content exploration task, which we formalize as a bandit problem with delayed rewards. There is an apparent trade-off in…

机器学习 · 计算机科学 2025-01-15 Kelly W. Zhang , Thomas Baldwin-McDonald , Kamil Ciosek , Lucas Maystre , Daniel Russo

Recommender systems relying on contextual multi-armed bandits continuously improve relevant item recommendations by taking into account the contextual information. The objective of bandit algorithms is to learn the best arm (e.g., best item…

机器学习 · 计算机科学 2025-12-10 Ahmed Sayeed Faruk , Elena Zheleva

Taking advantage of contextual information can potentially boost the performance of recommender systems. In the era of big data, such side information often has several dimensions. Thus, developing decision-making algorithms to cope with…

机器学习 · 计算机科学 2023-07-26 Saeed Ghoorchian , Evgenii Kortukov , Setareh Maghsudi

We propose and design recommendation systems that incentivize efficient exploration. Agents arrive sequentially, choose actions and receive rewards, drawn from fixed but unknown action-specific distributions. The recommendation system…

计算机科学与博弈论 · 计算机科学 2026-04-02 Nicole Immorlica , Jieming Mao , Aleksandrs Slivkins , Zhiwei Steven Wu

Recommender systems should adapt to user interests as the latter evolve. A prevalent cause for the evolution of user interests is the influence of their social circle. In general, when the interests are not known, online algorithms that…

机器学习 · 计算机科学 2020-09-23 Silviu Maniu , Stratis Ioannidis , Bogdan Cautis

Exposure bias is a well-known issue in recommender systems where items and suppliers are not equally represented in the recommendation results. This bias becomes particularly problematic over time as a few items are repeatedly…

信息检索 · 计算机科学 2024-08-09 Masoud Mansoury , Bamshad Mobasher , Herke van Hoof

We study the repeated principal-agent bandit game, where the principal indirectly interacts with the unknown environment by proposing incentives for the agent to play arms. Most existing work assumes the agent has full knowledge of the…

机器学习 · 计算机科学 2025-06-03 Junyan Liu , Lillian J. Ratliff

Exposure bias is a well-known issue in recommender systems where items and suppliers are not equally represented in the recommendation results. This is especially problematic when bias is amplified over time as a few items (e.g., popular…

信息检索 · 计算机科学 2022-09-07 Masoud Mansoury , Bamshad Mobasher , Herke van Hoof

In real-world streaming recommender systems, user preferences often dynamically change over time (e.g., a user may have different preferences during weekdays and weekends). Existing bandit-based streaming recommendation models only consider…

信息检索 · 计算机科学 2023-08-17 Chenglei Shen , Xiao Zhang , Wei Wei , Jun Xu

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually…

信息检索 · 计算机科学 2019-07-04 Yong Liu , Yingtai Xiao , Qiong Wu , Chunyan Miao , Juyong Zhang

In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some…

计算机科学与博弈论 · 计算机科学 2012-11-20 Morteza Zadimoghaddam , Aaron Roth

We consider the task of allocating indivisible items to agents, when the agents' preferences over the items are identical. The preferences are captured by means of a directed acyclic graph, with vertices representing items and an edge…

The recent advances of conversational recommendations provide a promising way to efficiently elicit users' preferences via conversational interactions. To achieve this, the recommender system conducts conversations with users, asking their…

信息检索 · 计算机科学 2022-09-14 Jinhang Zuo , Songwen Hu , Tong Yu , Shuai Li , Handong Zhao , Carlee Joe-Wong

Accuracy and diversity have long been considered to be two conflicting goals for recommendations. We point out, however, that as the diversity is typically measured by certain pre-selected item attributes, e.g., category as the most…

信息检索 · 计算机科学 2023-01-16 Xiaoying Zhang , Hongning Wang , Hang Li

Individual decision-makers consume information revealed by the previous decision makers, and produce information that may help in future decisions. This phenomenon is common in a wide range of scenarios in the Internet economy, as well as…

计算机科学与博弈论 · 计算机科学 2019-05-06 Yishay Mansour , Aleksandrs Slivkins , Vasilis Syrgkanis

We initiate the study of a repeated principal-agent problem over a finite horizon $T$, where a principal sequentially interacts with $K\geq 2$ types of agents arriving in an adversarial order. At each round, the principal strategically…

计算机科学与博弈论 · 计算机科学 2025-08-05 Junyan Liu , Arnab Maiti , Artin Tajdini , Kevin Jamieson , Lillian J. Ratliff

User preference learning is generally a hard problem. Individual preferences are typically unknown even to users themselves, while the space of choices is infinite. Here we study user preference learning from information-theoretic…

机器学习 · 计算机科学 2023-11-27 Tanya Ignatenko , Kirill Kondrashov , Marco Cox , Bert de Vries