Fair algorithms improve recommendations for users in overlapping groups
Fair Recommender Systems for Intersecting Groups
Machine LearningComputers and SocietyComputer Science and Game Theory
Summary
Recommendation systems that show what users might like often focus on average preferences, which can miss the tastes of smaller or overlapping groups of people. The authors study systems where users belong to multiple intersecting groups and propose methods that consider group information to make fairer recommendations. They show that ignoring group membership leads to worse results over time and introduce new algorithms that adapt recommendations based on overlapping groups. Experiments on book and game recommendation data show benefits depending on how much individual groups differ in their preferences.
What this means in practice
- •For streaming service engineers: Design recommendation engines that adjust suggestions fairly across users belonging to multiple overlapping demographic groups.
- •For online retail data teams: Improve product recommendations by considering intersecting customer groups, helping tailor offers to diverse overlapping preferences.
Authors
Christine Ling, Juba Ziani
Abstract
Recommendation systems that optimize for the average user can fail to capture the preferences of diverse demographic groups. We consider a dynamic recommendation system, where arriving users can belong to different demographic groups. Importantly, these groups can intersect, and a user may belong to several groups. We first show that over time, any group-blind policy (which excludes all current-user group information) recommending $K \geq 1$ items incurs linear total regret under mild conditions. In turn, we introduce three group-aware algorithms based on the classical Upper Confidence Bound algorithm (UCB): i) Intersection-Fitting, which runs UCB on each intersection, but has a sublinear group- and intersection-level regret guarantee with an exponential dependence in the number of groups; and ii) two group-level heuristics, Inner-Outer UCB and Group-Item UCB which allocate different arms to different groups, and use a sleeping expert meta-learner to choose which active group's recommendation an intersection should inherit at any given time step. We provide experimental results on two datasets, Goodreads and BoardGameGeek, and highlight that our heuristics can be preferable to the intersection-fitting algorithm when intersection-level preferences are closely related to group-level preferences, but that intersection-fitting performs better when different intersections within a same group prefer different items.