vix.ing · top · new · best · stats · spec

Fairness without Regret

2019/07/11 by Marcus Hütter, Hutter, Marcus
Neuroscience · Social Sciences · #Embodied and Extended Cognition #Ethics and Social Impacts of AI #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Qualitative Comparative Analysis Research

paper · pdf · doi:10.48550/arxiv.1907.05159

openalex publication_date 2019/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A popular approach of achieving fairness in optimization problems is by constraining the solution space to "fair" solutions, which unfortunately typically reduces solution quality. In practice, the ultimate goal is often an aggregate of sub-goals without a unique or best way of combining them or which is otherwise only partially known. I turn this problem into a feature and suggest to use a parametrized objective and vary the parameters within reasonable ranges to get a "set" of optimal solutions, which can then be optimized using secondary criteria such as fairness without compromising the primary objective, i.e. without regret (societal cost).

Related