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. 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:2608.30223v1 Announce Type: cross Abstract: We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes. In that sc...
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: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:2304. 13917v4 Announce Type: replace Abstract: In recent years, there has been a surge in effort to formalize notions of fairness in machine learning.
We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes. In that scenario each sensitive attribute has multiple values...
The paper introduces ROME, a framework that learns latent group structure while optimizing worst-group predictive performance. ROME links latent-variable modeling with distributionally robust optimization through an Expectation-Maximization approach for linear models and a neural Mixture-of-Experts for nonlinear settings. Experiments on simulations and three real-world regression datasets show that ROME improves worst-group performance while maintaining competitive overall accuracy compared to existing group-aware and group-label-free robust learning methods.
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: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.
FairLRF proposes a fairness-oriented low rank factorization framework that uses singular value decomposition (SVD) to improve deep learning model fairness. By selectively removing bias-inducing elements from the unitary matrices obtained via SVD, the method reduces group disparities while preserving accuracy. Experiments demonstrate that FairLRF outperforms existing low rank factorization and state-of-the-art fairness techniques, and an ablation study explores the impact of key hyper-parameters.
arXiv:2607. 08953v1 Announce Type: new Abstract: Algorithmic fairness methods are increasingly used to identify and mitigate bias in machine learning models, yet most approaches are evaluated in isolation and along single demographic axes.
arXiv:2609.25811v1 Announce Type: new Abstract: Multi-view clustering (MVC) aims to uncover latent cluster structures by exploiting complementary information from multiple views. Despite substantial...