Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachability
In this work, we consider how preference models in interactive recommendation systems determine the availability of content and users' opportunities for discovery. We propose an evaluation procedure based on stochastic reachability to quantify the maximum probability of recommending a target piece of content to an user for a set of allowable strategic modifications. This framework allows us to compute an upper bound on the likelihood of recommendation with minimal assumptions about user behavior. Stochastic reachability can be used to detect biases in the availability of content and diagnose limitations in the opportunities for discovery granted to users. We show that this metric can be computed efficiently as a convex program for a variety of practical settings, and further argue that reachability is not inherently at odds with accuracy. We demonstrate evaluations of recommendation algorithms trained on large datasets of explicit and implicit ratings. Our results illustrate how preference models, selection rules, and user interventions impact reachability and how these effects can be distributed unevenly.
Code (1)
Tasks
Interactive RecommendationRecommendation SystemsSimilar Papers 제목 키워드 기반
Theoretical Modeling of the Iterative Properties of User Discovery in a Collaborative Filtering Recommender System
The closed feedback loop in recommender systems is a common setting that can lead to different types of biases. Several studies have dealt with these biases by designing methods to mitigate their effect on the recommenda…
BIG-bench Machine LearningCollaborative FilteringRecommendation SystemsAlgorithmic Drift: A Simulation Framework to Study the Effects of Recommender Systems on User Preferences
Digital platforms such as social media and e-commerce websites adopt Recommender Systems to provide value to the user. However, the social consequences deriving from their adoption are still unclear. Many scholars argue …
Recommendation SystemsModel-free Reinforcement Learning with Stochastic Reward Stabilization for Recommender Systems
Model-free RL-based recommender systems have recently received increasing research attention due to their capability to handle partial feedback and long-term rewards. However, most existing research has ignored a critica…
Recommendation Systemsreinforcement-learningMembership Inference Attacks Against Recommender Systems
Recently, recommender systems have achieved promising performances and become one of the most widely used web applications. However, recommender systems are often trained on highly sensitive user data, thus potential dat…
Recommendation SystemsA recommender system for efficient discovery of new anomalies in large-scale access logs
We present a novel, non-standard recommender system for large-scale security policy management(SPM). Our system Helios discovers and recommends unknown and unseen anomalies in large-scale access logs with minimal supervi…
ManagementRecommendation Systems