Learn to be Fair without Labels: a Distribution-based Learning Framework for Fair Ranking
Fumian Chen, Hui Fang

TL;DR
This paper introduces a distribution-based fair learning framework for ranking that does not rely on fairness labels, using target fairness exposure distributions to improve fairness without sacrificing relevance.
Contribution
It proposes a novel label-free framework (DLF) for fair ranking that replaces fairness labels with target exposure distributions, enhancing fairness and control.
Findings
Outperforms existing fairness-aware ranking models in fairness metrics.
Maintains better relevance-fairness trade-off.
Validated on TREC fair ranking dataset.
Abstract
Ranking algorithms as an essential component of retrieval systems have been constantly improved in previous studies, especially regarding relevance-based utilities. In recent years, more and more research attempts have been proposed regarding fairness in rankings due to increasing concerns about potential discrimination and the issue of echo chamber. These attempts include traditional score-based methods that allocate exposure resources to different groups using pre-defined scoring functions or selection strategies and learning-based methods that learn the scoring functions based on data samples. Learning-based models are more flexible and achieve better performance than traditional methods. However, most of the learning-based models were trained and tested on outdated datasets where fairness labels are barely available. State-of-art models utilize relevance-based utility scores as a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
