Implicit Counterfactual Data Augmentation for Robust Learning
Not on the map. Why?
Abstract (arXiv)
Machine learning models are prone to capturing the spurious correlations between non-causal attributes and classes, with counterfactual data augmentation being a promising direction for breaking these spurious associations. However, generating counterfactual data explicitly poses a challenge, and incorporating augmented data into the training process decreases training efficiency. This study proposes an Implicit Counterfactual Data Augmentation (ICDA) method to remove spurious correlations and make stable predictions. Specifically, first, a novel sample-wise augmentation strategy is developed that generates semantically and counterfactually meaningful deep features with distinct augmentation strength for each sample. Second, we derive an easy-to-compute surrogate loss on the augmented feature set when the number of augmented samples becomes infinite. Third, two concrete schemes are proposed, including direct quantification and meta-learning, to derive the key parameters for the robust loss. In addition, ICDA is explained from a regularization perspective, revealing its capacity to improve intra-class compactness and augment margins at both class and sample levels. Extensive experiments have been conducted across various biased learning scenarios covering both image and text datasets, demonstrating that ICDA consistently enhances the generalization and robustness performance of popular networks.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 54 of its 68 references that are in the map. First posted on arXiv 26 Apr 2023.
Builds on
54 of 68 references.
References · 54
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2016Wide Residual Networkscited by 3,057
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2014Conditional Generative Adversarial Netscited by 2,152
- 2019Invariant Risk Minimizationcited by 1,832
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
38 more
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
- 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 806
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 704
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2017Wasserstein GANcited by 635
- 2020Long-tail learning via logit adjustmentcited by 605
- 2016Conditional Image Synthesis With Auxiliary Classifier GANscited by 562
- 2019BBN: Bilateral-Branch Network with Cumulative Learning for Long-Tailed Visual Recognitioncited by 403
- 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 397
- 2019Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classificationcited by 396
- 2016Large-Margin Softmax Loss for Convolutional Neural Networkscited by 296
- 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
- 2021Gradient Matching for Domain Generalizationcited by 258
- 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
- 2020Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effectcited by 256
- 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
- 2019Causality for Machine Learningcited by 242
- 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2018Dimensionality-Driven Learning with Noisy Labelscited by 173
- 2020To be Robust or to be Fair: Towards Fairness in Adversarial Trainingcited by 137
- 2021Counterfactual Generative Networkscited by 111
- 2022Causal Machine Learning: A Survey and Open Problemscited by 107
- 2021MetaSAug: Meta Semantic Augmentation for Long-Tailed Visual Recognitioncited by 99
- 2020Regularizing Deep Networks with Semantic Data Augmentationcited by 73
- 2020Generative Interventions for Causal Learningcited by 45
- 2016DisturbLabel: Regularizing CNN on the Loss Layercited by 41
- 2022Invariant Feature Learning for Generalized Long-Tailed Classificationcited by 34
- 2021Adaptive Logit Adjustment Loss for Long-Tailed Visual Recognitioncited by 33
- 2022MABEL: Attenuating Gender Bias using Textual Entailment Datacited by 31
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025CF-Seg: Counterfactuals meet Segmentationcited by 10
- 2026CoCoGEC: Counterfactual Generation for Robust Grammatical Error Correctioncited by 0
- 2026CoCoGEC: Counterfactual Generation for Robust Grammatical Error Correction13 Jun 2026
- 2025CF-Seg: Counterfactuals meet Segmentation19 Jun 2025