ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Sampling Ex-Post Group-Fair Rankings

Gorantla, S and Deshpande, A and Louis, A (2023) Sampling Ex-Post Group-Fair Rankings. In: International Joint Conference on Artificial Intelligence, IJCAI 2023, 19-25 August 2023, Macao, pp. 409-417.

[img] PDF
IJCAI 2023_2023_409-417_2023.pdf - Published Version
Restricted to Registered users only

Download (903kB) | Request a copy
Official URL: https://www.ijcai.org/proceedings/2023/46


Randomized rankings have been of recent interest to achieve ex-ante fairer exposure and better robustness than deterministic rankings. We propose a set of natural axioms for randomized group-fair rankings and prove that there exists a unique distribution D that satisfies our axioms and is supported only over ex-post group-fair rankings, i.e., rankings that satisfy given lower and upper bounds on group-wise representation in the top-k ranks. Our problem formulation works even when there is implicit bias, incomplete relevance information, or only ordinal ranking is available instead of relevance scores or utility values. We propose two algorithms to sample a random group-fair ranking from the distribution D mentioned above. Our first dynamic programming-based algorithm samples ex-post group-fair rankings uniformly at random in time O(k2l), where l is the number of groups. Our second random walk-based algorithm samples ex-post group-fair rankings from a distribution d-close to D in total variation distance and has expected running time O*(k2l2)1, when there is a sufficient gap between the given upper and lower bounds on the group-wise representation. The former does exact sampling, but the latter runs significantly faster on real-world data sets for larger values of k. We give empirical evidence that our algorithms compare favorably against recent baselines for fairness and ranking utility on real-world data sets. © 2023 International Joint Conferences on Artificial Intelligence. All rights reserved.

Item Type: Conference Paper
Publication: IJCAI International Joint Conference on Artificial Intelligence
Publisher: International Joint Conferences on Artificial Intelligence
Additional Information: The copyright for this article belongs to the International Joint Conferences on Artificial Intelligence.
Keywords: Artificial intelligence; Sampling, Data set; Deterministics; Ex antes; Lower and upper bounds; Ordinal ranking; Problem formulation; Random groups; Real-world; Relevance score; Utility values, Dynamic programming
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 24 Nov 2023 09:37
Last Modified: 24 Nov 2023 09:37
URI: https://eprints.iisc.ac.in/id/eprint/83230

Actions (login required)

View Item View Item