让模型按用户偏好灵活平衡公平性与准确率。
Controllable Pareto Trade-off between Fairness and Accuracy
- 用多目标优化结合参考向量,实现对公平与准确的可控权衡。
- 在仇恨言论检测和职业分类任务中,解集质量优于基线方法。
- 通过梯度平均与关键参数剪枝,提升训练稳定性和控制精度。
公平性与准确性之间的权衡是NLP任务中的核心挑战。现有工作聚焦于寻找单一‘最优’平衡点,但忽略了帕累托前沿上多样化的解决方案。本文提出可控帕累托权衡(CPT),根据用户定义的参考向量实现对公平性与准确性的灵活控制。为此,采用多目标优化(MOO)以获取帕累托前沿不同区域的解。然而,由于训练过程的随机性及高维梯度向量,精确控制仍具挑战。CPT通过两个机制解决:1)利用移动平均稳定公平性更新方向;2)仅保留关键参数的梯度进行剪枝。在仇恨言论检测与职业分类任务上的实验表明,CPT能生成更高质量的帕累托解集,且具备更强的可控性,可精准跟随人类设定的参考向量。
原文摘要 · Abstract (English)
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 dimentional 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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。