Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking. (arXiv:2204.13765v1 [cs.LG])

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, …

arxiv fairness graph optimization ranking search