Jakub Tarnawski, Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Submodular maximization has become established as the method of choice for the task of selecting representative and diverse summaries of data. However, if datapoints have sensitive attributes such as gender or age, such machine learning algorithms, left unchecked, are known to exhibit bias: under-or over-representation of particular groups. This has made the design of fair machine learning algorithms increasingly important. In this work we address the question: Is it possible to create fair summaries for massive datasets? To this end, we develop the first streaming approximation algorithms for submodular maximization under fairness constraints, for both monotone and non-monotone functions. We validate our findings empirically on exemplar-based clustering, movie recommendation, DPPbased summarization, and maximum coverage in social networks, showing that fairness constraints do not significantly impact utility.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.07431")
get_code_for_paper("2010.07431")
have("2010.07431")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.07431.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.07431)
Connect an agent — have() is free.