arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
arXiv:2603. 04689v3 Announce Type: replace-cross Abstract: Fair top-$k$ selection, which ensures appropriate proportional representation of members from minority or historically disadvantaged groups among the top-$k$ selected candidates, has drawn significant attention.
arXiv:2609.07974v1 Announce Type: cross Abstract: Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in mac...
arXiv:2510.03899v3 Announce Type: replace-cross Abstract: Balancing resource efficiency and fairness is critical in networked systems that support modern learning applications. We introduce the \emph...
arXiv:2602.08589v2 Announce Type: replace Abstract: PageRank (PR) is a fundamental algorithm in graph machine learning tasks. Owing to the increasing importance of algorithmic fairness, we consider t...
arXiv:2304. 13917v4 Announce Type: replace Abstract: In recent years, there has been a surge in effort to formalize notions of fairness in machine learning.
arXiv:2607. 18119v1 Announce Type: cross Abstract: Fair clustering aims to make cluster assignments independent of sensitive attributes, but this goal becomes challenging when multiple sensitive attributes jointly define many subgroups.
arXiv:2606. 20461v1 Announce Type: new Abstract: Machine learning models have been shown to exhibit discriminatory outcomes or degraded performance for individuals at the intersection of multiple sensitive attributes, such as race and gender.
arXiv:2606. 04777v1 Announce Type: new Abstract: Clustering is increasingly used to support high-impact decisions, yet standard objectives such as $k$-means can produce clusterings that treat demographic groups unequally.
arXiv:2606. 00656v1 Announce Type: cross Abstract: Ensuring fair and equitable treatment across diverse groups, particularly in multi-class classification tasks, poses a significant challenge due to the persistent biases inherent in machine learning models.
arXiv:2601. 07144v3 Announce Type: replace-cross Abstract: Ensuring fairness in matching algorithms is a key challenge in allocating scarce resources and positions.
The paper presents new algorithms for fair k‑center clustering in Euclidean spaces, where a dataset is divided into groups and each group has a limit on the number of centers that can be chosen. A parameterized approximation algorithm achieves a 2.732 ratio, which is improved to 2.414 with exponential time in k. By integrating this into a one‑pass streaming framework, the authors obtain streaming approximations of 4.464 (improvable to 3.828) and a polynomial‑time streaming algorithm with a 4.732 ratio, further reduced to 4.42, surpassing previous state‑of‑the‑art results. Experiments confirm that these methods outperform existing approaches in clustering accuracy.
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.