Controllable Pareto Trade-off between Fairness and Accuracy

Read full text
Authors: Yuefang Du, Jie Zhao, Yijun Yang, Tianyi Zhou
Cited by: 0

Abstract

The fairness-accuracy trade-off is a key challenge in NLP tasks.Current work focuses on finding a single "optimal" solution to balance the two objectives, which is limited considering the diverse solutions on the Pareto front.This work intends to provide controllable trade-offs according to the user's preference of the two objectives, which is defined as a reference vector.To achieve this goal, we apply multi-objective optimization (MOO), which can find solutions from various regions of the Pareto front.However, it is challenging to precisely control the trade-off due to the stochasticity of the training process and the high dimensional gradient vectors.Thus, we propose Controllable Pareto Trade-off (CPT) that can effectively train models to perform different trade-offs according to users' preferences.CPT 1) stabilizes the fairness update with a moving average of stochastic gradients to determine the update direction, and 2) prunes the gradients by only keeping the gradients of the critical parameters.We evaluate CPT on hate speech detection and occupation classification tasks.Experiments show that CPT can achieve a higher-quality set of solutions on the Pareto front than the baseline methods.It also exhibits better controllability and can precisely follow the human-defined reference vectors.

Fields of Study & Subjects

Emotion and Mood Recognition Ethics and Social Impacts of AI Adversarial Robustness in Machine Learning

Publication details

Journal / source
Proceedings of the 6th Workshop on Trustworthy NLP (TrustNLP 2026)
Publisher
Association for Computational Linguistics
Pages
108–120
Publication date
1 January 2026
Language
EN