paper-with-me

홈 › Papers

Toward Fairness via Maximum Mean Discrepancy Regularization on Logits Space

2024-02-20 · Hao-Wei Chung, Ching-Hao Chiu, Yu-Jen Chen, Yiyu Shi, Tsung-Yi Ho

Fairness has become increasingly pivotal in machine learning for high-risk applications such as machine learning in healthcare and facial recognition. However, we see the deficiency in the previous logits space constraint methods. Therefore, we propose a novel framework, Logits-MMD, that achieves the fairness condition by imposing constraints on output logits with Maximum Mean Discrepancy. Moreover, quantitative analysis and experimental results show that our framework has a better property that outperforms previous methods and achieves state-of-the-art on two facial recognition datasets and one animal dataset. Finally, we show experimental results and demonstrate that our debias approach achieves the fairness condition effectively.

📄 PDF Abstract BibTeX arXiv:2402.13061

Code (0)

등록된 구현이 없습니다.

Tasks

Fairness

Similar Papers 제목 키워드 기반

Global Group Fairness in Federated Learning via Function Tracking

2025-03-19 · Yves Rychener, Daniel Kuhn, Yifan Hu

We investigate group fairness regularizers in federated learning, aiming to train a globally fair model in a distributed setting. Ensuring global fairness in distributed training presents unique challenges, as fairness r…

FairnessFederated Learning

Maximum Weighted Loss Discrepancy

2019-06-08 · Fereshte Khani, aditi raghunathan, Percy Liang

Though machine learning algorithms excel at minimizing the average loss over a population, this might lead to large discrepancies between the losses across groups within the population. To capture this inequality, we int…

FairnessGeneralization Bounds

Fair Bayesian Data Selection via Generalized Discrepancy Measures

2025-11-10 · Yixuan Zhang, Jiabin Luo, Zhenggang Wang, Feng Zhou 외 arxiv

Fairness concerns are increasingly critical as machine learning models are deployed in high-stakes applications. While existing fairness-aware methods typically intervene at the model level, they often suffer from high c…

(De)-regularized Maximum Mean Discrepancy Gradient Flow

2024-09-23 · Zonghao Chen, Aratrika Mustafi, Pierre Glaser, Anna Korba 외

We introduce a (de)-regularization of the Maximum Mean Discrepancy (DrMMD) and its Wasserstein gradient flow. Existing gradient flows that transport samples from source distribution to target distribution with only targe…

Incorporating Fairness Constraints into Archetypal Analysis

2025-07-16 · Aleix Alcacer, Irene Epifanio arxiv

Archetypal Analysis (AA) is an unsupervised learning method that represents data as convex combinations of extreme patterns called archetypes. While AA provides interpretable and low-dimensional representations, it can i…

Representation Learning