Reducing Disparate Exposure in Ranking: A Learning To Rank Approach

05/22/2018
by   Meike Zehlike, et al.
0

In this paper we consider a ranking problem in which we would like to order a set of items by utility or relevance, while also considering the visibility of different groups of items. To solve this problem, we adopt a supervised learning to rank approach that learns a ranking function from a set of training examples, which are queries and ranked lists of documents for each query. We consider that the elements to be ranked are divided into two groups: protected and non-protected. Following long-standing empirical observations showing that users of information retrieval systems rarely look past the first few results, we consider that some items receive more exposure than others. Our objective is to produce a ranker that is able to reproduce the ordering of the training set, which is the standard objective in learning to rank, but that additionally gives protected elements sufficient exposure, compared to non-protected elements. We demonstrate how to describe this objective formally, how to achieve it effectively and implement it, and present an experimental study describing how large differences in exposure can be reduced without having to introduce large distortions in the ranking utility.

READ FULL TEXT

page 7

page 8

research
12/12/2021

Fairness for Robust Learning to Rank

While conventional ranking systems focus solely on maximizing the utilit...
research
12/30/2022

Detection of Groups with Biased Representation in Ranking

Real-life tools for decision-making in many critical domains are based o...
research
04/27/2020

Evaluating Stochastic Rankings with Expected Exposure

We introduce the concept of expected exposure as the average attention r...
research
12/21/2021

Understanding and Mitigating the Effect of Outliers in Fair Ranking

Traditional ranking systems are expected to sort items in the order of t...
research
12/10/2018

Top-N-Rank: A Scalable List-wise Ranking Method for Recommender Systems

We propose Top-N-Rank, a novel family of list-wise Learning-to-Rank mode...
research
02/21/2023

Overview of the TREC 2021 Fair Ranking Track

The TREC Fair Ranking Track aims to provide a platform for participants ...
research
02/11/2023

Overview of the TREC 2022 Fair Ranking Track

The TREC Fair Ranking Track aims to provide a platform for participants ...

Please sign up or login with your details

Forgot password? Click here to reset