Browse State-of-the-Art › Exposure Fairness
Exposure Fairness
8 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
8 shown of 8 papers with code (15 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
29 Apr 2022 2 repositories listed Syntology ran 7 of 9 samples · 2 unverified · 9 pointer-only (licence)Prior research on exposure fairness in the context of recommender systems has focused mostly on disparities in the exposure of individual or groups of items to individual users of the system.
-
17 Feb 2025 1 repository listedMotivated by this, we present a new approach for jointly evaluating fairness and relevance in RSs: Distance to Pareto Frontier (DPFR).
-
8 Aug 2024 1 repository listedIn this paper, we study exposure bias in a class of well-known contextual bandit algorithms known as Linear Cascading Bandits.
-
28 May 2024 1 repository listedWe find that most of these measures: i) correlate weakly with one another and even contradict each other at times; ii) are less sensitive to rank position changes than relevance- and fairness-only measures, meaning that…
-
22 Feb 2024 1 repository listedTypical recommendation and ranking methods aim to optimize the satisfaction of users, but they are often oblivious to their impact on the items (e.
-
8 Feb 2024 1 repository listedAt the first level, Bi-Level Fairness guarantees a certain minimum exposure to each group.
-
2 Nov 2023 1 repository listedTo our knowledge, this is the first critical comparison of individual item fairness measures in recommender systems.
-
25 Apr 2022 1 repository listedTo fill this gap, we propose a Generative Adversarial Networks (GANs) based learning algorithm FairGAN mapping the exposure fairness issue to the problem of negative preferences in implicit feedback data.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections