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: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...
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: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: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: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: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. 23221v2 Announce Type: replace Abstract: As acquiring reliable ground-truth labels is usually costly, or infeasible, crowdsourcing and aggregation of noisy human annotations is the typical resort.
arXiv:2606. 17810v1 Announce Type: cross Abstract: In this paper, we establish a set of theoretical impossibility results, termed the No-Free-Fairness theorems, that identify three fundamental sources of disparity in learning systems.
The paper investigates hierarchical clustering under an individual fairness constraint that limits relative distortion within local k‑nearest neighborhoods. It formulates this as a feasibility problem over dominated ultrametrics, characterizes the minimal multiplicative slack needed, identifies a sharp local threshold, proves stability under bounded perturbations, establishes monotonicity in k, and demonstrates a Θ(log n) separation between local and global realizability. Experiments on synthetic and real‑world datasets corroborate the theoretical findings.
arXiv:2609.07959v1 Announce Type: cross Abstract: Machine learning models are widely used in clinical applications, social media, law enforcement and critical infrastructure. Verifying whether their...
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. 21393v2 Announce Type: replace Abstract: The widespread use of AI and ML models in sensitive areas raises significant concerns about fairness.