arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.05707cs.CVcs.LG

Fairness by Learning Orthogonal Disentangled Representations

Technical University of Munich(慕尼黑工业大学);Carl Zeiss Meditec AG(卡尔蔡司医疗股份有限公司);Johns Hopkins University(约翰斯·霍普金斯大学);ETH Zurich(苏黎世联邦理工学院)

Mhd Hasan Sarhan, Nassir Navab, Abouzar Eslami, Shadi Albarqouni

英文摘要:

Learning discriminative powerful representations is a crucial step for machine learning systems. Introducing invariance against arbitrary nuisance or sensitive attributes while performing well on specific tasks is an important problem in representation learning. This is mostly approached by purging the sensitive information from learned representations. In this paper, we propose a novel disentanglement approach to invariant representation problem. We disentangle the meaningful and sensitive representations by enforcing orthogonality constraints as a proxy for independence. We explicitly enforce the meaningful representation to be agnostic to sensitive information by entropy maximization. The proposed approach is evaluated on five publicly available datasets and compared with state of the art methods for learning fairness and invariance achieving the state of the art performance on three datasets and comparable performance on the rest. Further, we perform an ablative study to evaluate the effect of each component.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑