Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fairness in Submodular Maximization over a Matroid Constraint

Published 21 Dec 2023 in cs.LG, cs.CY, cs.DM, cs.DS, math.CO, and math.OC | (2312.14299v1)

Abstract: Submodular maximization over a matroid constraint is a fundamental problem with various applications in machine learning. Some of these applications involve decision-making over datapoints with sensitive attributes such as gender or race. In such settings, it is crucial to guarantee that the selected solution is fairly distributed with respect to this attribute. Recently, fairness has been investigated in submodular maximization under a cardinality constraint in both the streaming and offline settings, however the more general problem with matroid constraint has only been considered in the streaming setting and only for monotone objectives. This work fills this gap. We propose various algorithms and impossibility results offering different trade-offs between quality, fairness, and generality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Computing welfare-maximizing fair allocations of indivisible goods. European Journal of Operational Research, 307(2):773–784, 2023.
  2. Finding fair and efficient allocations for matroid rank valuations. ACM Transactions on Economics and Computation, 9(4):1–41, 2021.
  3. Dan Biddle. Adverse impact and test validation: A practitioner’s guide to valid and defensible employment testing. Gower Publishing, Ltd., 2006.
  4. Multiwinner approval rules as apportionment methods. In AAAI, pages 414–420. AAAI Press, 2017.
  5. Submodular maximization with cardinality constraints. SIAM, 2014.
  6. Constrained submodular maximization via a nonsymmetric technique. Mathematics of Operations Research, 44(3):988–1005, 2019.
  7. Constrained submodular maximization via new bounds for dr-submodular functions. arXiv preprint arXiv: 2311.01129, 2023.
  8. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740–1766, 2011a.
  9. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740–1766, 2011b.
  10. Multiwinner voting with fairness constraints. In IJCAI, pages 144–151. ijcai.org, 2018a.
  11. Fair and diverse dpp-based data summarization. In ICML, volume 80 of Proceedings of Machine Learning Research, pages 715–724. PMLR, 2018b.
  12. Ranking with fairness constraints. In ICALP, volume 107 of LIPIcs, pages 28:1–28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018c.
  13. Dependent randomized rounding for matroid polytopes and applications. arXiv preprint arXiv:0909.4348, 2009.
  14. Dependent randomized rounding via exchange properties of combinatorial structures. In FOCS, pages 575–584. IEEE Computer Society, 2010.
  15. Fair clustering through fairlets. In NIPS, pages 5029–5037, 2017.
  16. Matroids, matchings, and fairness. In AISTATS, volume 89 of Proceedings of Machine Learning Research, pages 2212–2220. PMLR, 2019.
  17. Effective recruiting for diversity. In FIE, pages 1123–1124. IEEE Computer Society, 2013.
  18. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In ICML, pages 1057–1064. Omnipress, 2011.
  19. Donglei Du. Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization. arXiv preprint arXiv:2205.12442, 2022.
  20. Fairness through awareness. In Proceedings of the 3rd innovations in theoretical computer science conference, pages 214–226, 2012.
  21. Beyond keyword search: discovering relevant scientific literature. In KDD, pages 439–447. ACM, 2011.
  22. Fairness in streaming submodular maximization: Algorithms and hardness. In NeurIPS, 2020.
  23. Fairness in streaming submodular maximization over a matroid constraint. In International Conference on Machine Learning, pages 9150–9171. PMLR, 2023.
  24. European Union FRA. Bias in Algorithms –– Artificial Intelligence and Discrimination. European Union Agency for Fundamental Rights. Publications Office of the European Union, Luxembourg, 2022.
  25. Uriel Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634–652, 1998.
  26. A unified continuous greedy algorithm for submodular maximization. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 570–579. IEEE, 2011.
  27. The one-way communication complexity of submodular maximization with applications to streaming and robustness. In STOC, pages 1363–1374. ACM, 2020.
  28. Streaming submodular maximization under matroid constraints. arXiv preprint arXiv:2107.07183, 2021.
  29. Semi-streaming algorithms for submodular matroid intersection. In IPCO, volume 12707 of Lecture Notes in Computer Science, pages 208–222. Springer, 2021.
  30. Adaptive submodularity: Theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res., 42:427–486, 2011.
  31. HO Hartley and JNK Rao. Sampling with unequal probabilities and without replacement. The Annals of Mathematical Statistics, pages 350–374, 1962.
  32. Inapproximability results for combinatorial auctions with submodular utility functions. In Internet and Network Economics: First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005. Proceedings 1, pages 92–101. Springer, 2005.
  33. Robust submodular observation selection. Journal of Machine Learning Research, 9(Dec):2761–2801, 2008.
  34. Submodular maximization over multiple matroids via generalized exchange properties. Mathematics of Operations Research, 35(4):795–806, 2010.
  35. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55(2):270–296, 2006.
  36. A class of submodular functions for document summarization. In ACL, pages 510–520. The Association for Computer Linguistics, 2011.
  37. Burt L Monroe. Fully proportional representation. American Political Science Review, 89(4):925–940, 1995.
  38. Resolving the approximability of offline and online non-monotone dr-submodular maximization over general convex sets. In Francisco Ruiz, Jennifer Dy, and Jan-Willem van de Meent, editors, Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, volume 206 of Proceedings of Machine Learning Research, pages 2542–2564. PMLR, 25–27 Apr 2023.
  39. Big data: A report on algorithmic systems, opportunity, and civil rights. Executive Office of the President. The White House, Washington, DC, 2016.
  40. Submodular maximization by simulated annealing. In SODA, pages 1098–1116. SIAM, 2011.
  41. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency. Springer Science & Business Media, 2003.
  42. Equitability and welfare maximization for allocating indivisible items. Autonomous Agents and Multi-Agent Systems, 37(1):8, 2023.
  43. Beyond submodularity: a unified framework of randomized set selection with group fairness constraints. Journal of Combinatorial Optimization, 45(4):102, 2023.
  44. Achieving long-term fairness in submodular maximization through randomization. arXiv preprint arXiv:2304.04700, 2023.
  45. Group-fairness in influence maximization. In IJCAI, pages 5997–6005. ijcai.org, 2019.
  46. Rajan Udwani. Multi-objective maximization of monotone submodular functions with cardinality constraint. Advances in Neural Information Processing Systems, 31, 2018.
  47. Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 67–74, 2008.
  48. Jan Vondrák. Symmetry and approximability of submodular maximization problems. SIAM Journal on Computing, 42(1):265–304, 2013.
  49. Jan Vondrák. Submodular functions and their applications, 2013. URL https://theory.stanford.edu/~jvondrak/data/SODA-plenary-talk.pdf. Plenary talk at the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013.
  50. Fair and representative subset selection from data streams. In Proceedings of the Web Conference 2021, pages 1340–1350, 2021.
  51. Balancing utility and fairness in submodular maximization. In Proceedings of the 27th International Conference on Extending Database Technology, EDBT, pages 1–14, 2024.
  52. White House OSTP. Blueprint for an AI Bill of Rights. White House Office of Science and Technology Policy, Washington, DC, 2022.
  53. Group fairness in non-monotone submodular maximization. Journal of Combinatorial Optimization, 45(3):88, 2023.
  54. Fairness constraints: Mechanisms for fair classification. In AISTATS, volume 54 of Proceedings of Machine Learning Research, pages 962–970. PMLR, 2017.
Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up