Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fairness in Streaming Submodular Maximization: Algorithms and Hardness   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, DPP-based summarization, and maximum coverage in social
networks, showing that fairness constraints do not significantly impact
utility.

37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
28
The categories of this paper are: alg-geom
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph