dorsal/arxiv
View SchemaImproved Algorithms for Fair Matroid Submodular Maximization
| Authors | Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski |
|---|---|
| Categories | |
| ArXiv ID | 2601.09860vv1 |
| URL | https://arxiv.org/abs/2601.09860 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Submodular maximization subject to matroid constraints is a central problem with many applications in machine learning. As algorithms are increasingly used in decision-making over datapoints with sensitive attributes such as gender or race, it is becoming crucial to enforce fairness to avoid bias and discrimination. Recent work has addressed the challenge of developing efficient approximation algorithms for fair matroid submodular maximization. However, the best algorithms known so far are only guaranteed to satisfy a relaxed version of the fairness constraints that loses a factor 2, i.e., the problem may ask for $\ell$ elements with a given attribute, but the algorithm is only guaranteed to find $\lfloor \ell/2 \rfloor$. In particular, there is no provable guarantee when $\ell=1$, which corresponds to a key special case of perfect matching constraints. In this work, we achieve a new trade-off via an algorithm that gets arbitrarily close to full fairness. Namely, for any constant $\varepsilon>0$, we give a constant-factor approximation to fair monotone matroid submodular maximization that in expectation loses only a factor $(1-\varepsilon)$ in the lower-bound fairness constraint. Our empirical evaluation on a standard suite of real-world datasets -- including clustering, recommendation, and coverage tasks -- demonstrates the practical effectiveness of our methods.
{
"annotation_id": "69c2b462-33f9-4412-94b5-c7b138a68d00",
"date_created": "2026-02-17T05:53:23.732000Z",
"date_modified": "2026-02-17T05:53:23.732000Z",
"file_hash": "b44cbba9726367ea146cb852c99e8fc46a9bd986ba46f58cb6d7bcc0338fe8ce",
"private": false,
"record": {
"abstract": "Submodular maximization subject to matroid constraints is a central problem with many applications in machine learning. As algorithms are increasingly used in decision-making over datapoints with sensitive attributes such as gender or race, it is becoming crucial to enforce fairness to avoid bias and discrimination. Recent work has addressed the challenge of developing efficient approximation algorithms for fair matroid submodular maximization. However, the best algorithms known so far are only guaranteed to satisfy a relaxed version of the fairness constraints that loses a factor 2, i.e., the problem may ask for $\\ell$ elements with a given attribute, but the algorithm is only guaranteed to find $\\lfloor \\ell/2 \\rfloor$. In particular, there is no provable guarantee when $\\ell=1$, which corresponds to a key special case of perfect matching constraints.\n In this work, we achieve a new trade-off via an algorithm that gets arbitrarily close to full fairness. Namely, for any constant $\\varepsilon\u003e0$, we give a constant-factor approximation to fair monotone matroid submodular maximization that in expectation loses only a factor $(1-\\varepsilon)$ in the lower-bound fairness constraint. Our empirical evaluation on a standard suite of real-world datasets -- including clustering, recommendation, and coverage tasks -- demonstrates the practical effectiveness of our methods.",
"arxiv_id": "2601.09860",
"authors": [
"Sepideh Mahabadi",
"Sherry Sarkar",
"Jakub Tarnawski"
],
"categories": [
"cs.DS"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Improved Algorithms for Fair Matroid Submodular Maximization",
"url": "https://arxiv.org/abs/2601.09860",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a70fc54f-e7be-4fcf-a97a-8a84a539684d",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}