Fair Class-Incremental Learning using Sample Weighting
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 67 of its 105 references that are in the map. First posted on arXiv 2 Oct 2024.
Builds on
67 of 105 references.
References · 67
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
38 more
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2019Large Scale Incremental Learningcited by 727
- 2014Certifying and removing disparate impactcited by 715
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2019Three scenarios for continual learningcited by 610
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 602
- 2018A Reductions Approach to Fair Classificationcited by 585
- 2019Gradient based sample selection for online continual learningcited by 568
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
- 2017On Fairness and Calibrationcited by 406
- 2017Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairnesscited by 381
- 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 346
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
- 2019On Tiny Episodic Memories in Continual Learningcited by 299
- 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
- 2021Online Continual Learning in Image Classification: An Empirical Surveycited by 242
- 2022FOSTER: Feature Boosting and Compression for Class-Incremental Learningcited by 228
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
- 2023Class-Incremental Learning: A Surveycited by 209
- 2019Learning De-biased Representations with Biased Representationscited by 199
- 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 160
- 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 152
- 2018Towards Robust Evaluations of Continual Learningcited by 148
- 2019Identifying and Correcting Label Bias in Machine Learningcited by 146
- 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 114
- 2020A Comprehensive Study of Class Incremental Learning Algorithms for Visual Taskscited by 107
- 2020FairBatch: Batch Selection for Model Fairnesscited by 99
- 2021Trustworthy AI: A Computational Perspectivecited by 93
- 2020Investigating Bias and Fairness in Facial Expression Recognitioncited by 87
- 2015Parallelizing the dual revised simplex methodcited by 83
- 2019Leveraging Labeled and Unlabeled Data for Consistent Fair Binary Classificationcited by 60
- 2018Two-Player Games for Efficient Non-Convex Constrained Optimizationcited by 55
- 2019Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applicationscited by 55
50 most cited of 67 All 67 (JSON)
Built on by
Not cited yet.