Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking

Abstract

There are several measures for fairness in ranking, based on different underlying assumptions and perspectives. PL optimization with the REINFORCE algorithm can be used for optimizing black-box objective functions over permutations. In particular, it can be used for optimizing fairness measures. However, though effective for queries with a moderate number of repeating sessions, PL optimization has room for improvement for queries with a small number of repeating sessions. In this paper, we present a novel way of representing permutation distributions, based on the notion of permutation graphs. Similar to PL, our distribution representation, called PPG, can be used for black-box optimization of fairness. Different from PL, where pointwise logits are used as the distribution parameters, in PPG pairwise inversion probabilities together with a reference permutation construct the distribution. As such, the reference permutation can be set to the best sampled permutation regarding the objective function, making PPG suitable for both deterministic and stochastic rankings. Our experiments show that PPG, while comparable to PL for larger session repetitions (i.e., stochastic ranking), improves over PL for optimizing fairness metrics for queries with one session (i.e., deterministic ranking). Additionally, when accurate utility estimations are available, e.g., in tabular models, the performance of PPG in fairness optimization is significantly boosted compared to lower quality utility estimations from a learning to rank model, leading to a large performance gap with PL. Finally, the pairwise probabilities make it possible to impose pairwise constraints such as "item $d_1$ should always be ranked higher than item $d_2$." Such constraints can be used to simultaneously optimize the fairness metric and control another objective such as ranking performance.

arXiv commentSIGIR 2022

References in corpus (17)

• Fairness of Exposure in Rankings
• FA*IR: A Fair Top-k Ranking Algorithm
• Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search
• Equity of Attention: Amortizing Individual Fairness in Rankings
• Controlling Fairness and Bias in Dynamic Learning-to-Rank
• Introducing LETOR 4.0 Datasets
• Evaluating Stochastic Rankings with Expected Exposure
• DCM Bandits: Learning to Rank with Multiple Clicks
• When Inverse Propensity Scoring does not Work: Affine Corrections for Unbiased Learning to Rank
• Policy Learning for Fairness in Ranking
• Policy-Gradient Training of Fair and Unbiased Ranking Functions
• Multiple-Play Bandits in the Position-Based Model
• Fairness of Exposure in Light of Incomplete Exposure Estimation
• Understanding and Mitigating the Effect of Outliers in Fair Ranking
• BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback
• Mixture-Based Correction for Position and Trust Bias in Counterfactual Learning to Rank
• Overview of the TREC 2019 Fair Ranking Track

Cited by in corpus (3)

• Fairness of Exposure in Light of Incomplete Exposure Estimation
• On the Impact of Outlier Bias on User Clicks
• Recent Advances in the Foundations and Applications of Unbiased Learning to Rank