通过加权样本缓解增量学习中的不公平遗忘问题
Fair Class-Incremental Learning using Sample Weighting
- 根据梯度方向调整当前任务样本权重,防止敏感群体遗忘
- 在真实数据集上实现更优的准确率与公平性平衡
- 适合关注AI公平性的研究者与从业者
模型公平性在可信AI的类增量学习中日益重要。尽管准确率是类增量学习的核心,但公平性研究仍较薄弱。直接使用当前任务全部样本训练会导致某些敏感群体出现不公平的灾难性遗忘。我们理论分析发现,当当前任务数据的平均梯度向量与敏感群体的平均梯度向量方向相反(内积为负)时,遗忘即发生。为此,我们提出一种公平的类增量学习框架,通过调整当前任务样本的训练权重,改变平均梯度方向,从而减少弱势群体的遗忘并提升公平性。针对多种群体公平性度量,我们建立优化问题,在最小化敏感群体总体损失的同时,降低群体间差异。问题可通过线性规划求解,并提出高效的公平感知样本加权(FSW)算法。实验表明,FSW在真实数据集上优于现有先进方法,实现了更好的准确率-公平性权衡。
原文摘要 · Abstract (English)
Model fairness is becoming important in class-incremental learning for Trustworthy AI. While accuracy has been a central focus in class-incremental learning, fairness has been relatively understudied. However, naively using all the samples of the current task for training results in unfair catastrophic forgetting for certain sensitive groups including classes. We theoretically analyze that forgetting occurs if the average gradient vector of the current task data is in an "opposite direction" compared to the average gradient vector of a sensitive group, which means their inner products are negative. We then propose a fair class-incremental learning framework that adjusts the training weights of current task samples to change the direction of the average gradient vector and thus reduce the forgetting of underperforming groups and achieve fairness. For various group fairness measures, we formulate optimization problems to minimize the overall losses of sensitive groups while minimizing the disparities among them. We also show the problems can be solved with linear programming and propose an efficient Fairness-aware Sample Weighting (FSW) algorithm. Experiments show that FSW achieves better accuracy-fairness tradeoff results than state-of-the-art approaches on real datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。