REVIEW 2 cited by
Optimizing generalized Gini indices for fairness in rankings
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
There is growing interest in designing recommender systems that aim at being fair towards item producers or their least satisfied users. Inspired by the domain of inequality measurement in economics, this paper explores the use of generalized Gini welfare functions (GGFs) as a means to specify the normative criterion that recommender systems should optimize for. GGFs weight individuals depending on their ranks in the population, giving more weight to worse-off individuals to promote equality. Depending on these weights, GGFs minimize the Gini index of item exposure to promote equality between items, or focus on the performance on specific quantiles of least satisfied users. GGFs for ranking are challenging to optimize because they are non-differentiable. We resolve this challenge by leveraging tools from non-smooth optimization and projection operators used in differentiable sorting. We present experiments using real datasets with up to 15k users and items, which show that our approach obtains better trade-offs than the baselines on a variety of recommendation tasks and fairness criteria.
Forward citations
Cited by 2 Pith papers
-
Inference-Time Policy Alignment for Fair Reinforcement Learning
A frozen RL policy can be reweighted at test time by a learned generalized-Gini welfare critic to improve fairness metrics, though the central equivalence mixes up two different welfare objectives.
-
Parallel and Mini-Batch Stable Matching for Large-Scale Reciprocal Recommender Systems
A mini-batch, parallelized form of the IPFP stable matching algorithm lets reciprocal recommender systems process up to 10^6 users on one GPU while keeping the match count close to the exact algorithm.
Discussion (0). Continue with ORCID to comment.