Skip to main navigation Skip to search Skip to main content

Achieving Long-Term Fairness in Submodular Maximization Through Randomization

  • University of North Texas

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Submodular function optimization is applied in ML and data analysis, including diverse dataset summarization. Fairness-aware algorithms are essential for handling sensitive attributes. Our research investigates the problem of maximizing a monotone submodular function while adhering to constraints on the expected number of selected items per group. Our goal is to compute a distribution over feasible sets, and to achieve this, we develop a series of approximation algorithms.

Original languageEnglish
Title of host publicationAIRO Springer Series
PublisherSpringer Nature
Pages161-173
Number of pages13
DOIs
StatePublished - 2024

Publication series

NameAIRO Springer Series
Volume13
ISSN (Print)2523-7047
ISSN (Electronic)2523-7055

Fingerprint

Dive into the research topics of 'Achieving Long-Term Fairness in Submodular Maximization Through Randomization'. Together they form a unique fingerprint.

Cite this