mlsanityData to 7 Oct 2026

AutoCAD: Automatically Generating Counterfactuals for Mitigating Shortcut Learning

arXiv 2211.16202 ↗First posted 29 Nov 2022cs.AI cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent studies have shown the impressive efficacy of counterfactually augmented data (CAD) for reducing NLU models' reliance on spurious features and improving their generalizability. However, current methods still heavily rely on human efforts or task-specific designs to generate counterfactuals, thereby impeding CAD's applicability to a broad range of NLU tasks. In this paper, we present AutoCAD, a fully automatic and task-agnostic CAD generation framework. AutoCAD first leverages a classifier to unsupervisedly identify rationales as spans to be intervened, which disentangles spurious and causal features. Then, AutoCAD performs controllable generation enhanced by unlikelihood training to produce diverse counterfactuals. Extensive evaluations on multiple out-of-domain and challenge benchmarks demonstrate that AutoCAD consistently and significantly boosts the out-of-distribution performance of powerful pre-trained models across different NLU tasks, which is comparable or even better than previous state-of-the-art human-in-the-loop or task-specific CAD methods. The code is publicly available at https://github.com/thu-coai/AutoCAD.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 54 of its 64 references that are in the map. First posted on arXiv 29 Nov 2022.

Builds on

54 of 64 references.

References · 54

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  5. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  8. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  9. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
  10. 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
  11. 2020Shortcut Learning in Deep Neural Networkscited by 1,928
  12. 2015A large annotated corpus for learning natural language inferencecited by 1,837
38 more
  1. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
  2. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  3. 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,068
  4. 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 793
  5. 2015Improving Neural Machine Translation Models with Monolingual Datacited by 784
  6. 2019CTRL: A Conditional Transformer Language Model for Controllable Generationcited by 754
  7. 2018Annotation Artifacts in Natural Language Inference Datacited by 656
  8. 2019ERASER: A Benchmark to Evaluate Rationalized NLP Modelscited by 523
  9. 2019Neural Text Generation with Unlikelihood Trainingcited by 489
  10. 2018e-SNLI: Natural Language Inference with Natural Language Explanationscited by 468
  11. 2021DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Expertscited by 434
  12. 2019Learning the Difference that Makes a Difference with Counterfactually-Augmented Datacited by 428
  13. 2020GeDi: Generative Discriminator Guided Sequence Generationcited by 377
  14. 2021FUDGE: Controlled Text Generation With Future Discriminatorscited by 374
  15. 2016Rationalizing Neural Predictionscited by 281
  16. 2019Don't Take the Easy Way Out: Ensemble Based Methods for Avoiding Known Dataset Biasescited by 279
  17. 2017Style Transfer from Non-Parallel Text by Cross-Alignmentcited by 246
  18. 2016Understanding Neural Networks through Representation Erasurecited by 223
  19. 2021Polyjuice: Generating Counterfactuals for Explaining, Evaluating, and Improving Modelscited by 219
  20. 2018Stress Test Evaluation for Natural Language Inferencecited by 211
  21. 2015Visualizing and Understanding Neural Models in NLPcited by 199
  22. 2020Data Augmentation using Pre-trained Transformer Modelscited by 168
  23. 2018Breaking NLI Systems with Sentences that Require Simple Lexical Inferencescited by 134
  24. 2020Invariant Rationalizationcited by 131
  25. 2019End-to-End Bias Mitigation by Modelling Biases in Corporacited by 127
  26. 2019Unlearn Dataset Bias in Natural Language Inference by Fitting the Residualcited by 119
  27. 2020Towards Debiasing NLU Models from Unknown Biasescited by 116
  28. 2020Explaining NLP Models via Minimal Contrastive Editing (MiCE)cited by 105
  29. 2021Competency Problems: On Finding and Removing Artifacts in Language Datacited by 91
  30. 2016Yelp Dataset Challenge: Review Rating Predictioncited by 84
  31. 2021Towards Interpreting and Mitigating Shortcut Learning Behavior of NLU Modelscited by 78
  32. 2020Generate Your Counterfactuals: Towards Controlled Counterfactual Generation for Textcited by 75
  33. 2020An Information Bottleneck Approach for Controlling Conciseness in Rationale Extractioncited by 69
  34. 2020Explaining The Efficacy of Counterfactually Augmented Datacited by 64
  35. 2022Generating Data to Mitigate Spurious Correlations in Natural Language Inference Datasetscited by 54
  36. 2021An Investigation of the (In)effectiveness of Counterfactually Augmented Datacited by 42
  37. 2021Understanding Interlocking Dynamics of Cooperative Rationalizationcited by 36
  38. 2021FlipDA: Effective and Robust Data Augmentation for Few-Shot Learningcited by 32

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

4 papers.