Countering Overfitting with Counterfactual Examples
Not on the map. Why?
Abstract (arXiv)
Overfitting is a well-known issue in machine learning that occurs when a model struggles to generalize its predictions to new, unseen data beyond the scope of its training set. Traditional techniques to mitigate overfitting include early stopping, data augmentation, and regularization. In this work, we demonstrate that the degree of overfitting of a trained model is correlated with the ability to generate counterfactual examples. The higher the overfitting, the easier it will be to find a valid counterfactual example for a randomly chosen input data point. Therefore, we introduce CF-Reg, a novel regularization term in the training loss that controls overfitting by ensuring enough margin between each instance and its corresponding counterfactual. Experiments conducted across multiple datasets and models show that our counterfactual regularizer generally outperforms existing regularization techniques.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 39 references that are in the map. First posted on arXiv 13 Feb 2025.
Builds on
18 of 39 references.
References · 18
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2018Disentangling Adversarial Robustness and Generalizationcited by 171
- 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 165
- 2013Early stopping and non-parametric regression: An optimal data-dependent stopping rulecited by 86
- 2017Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweakingcited by 76
- 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
6 more
- 2020The Intriguing Relation Between Counterfactual Explanations and Adversarial Examplescited by 44
- 2019FOCUS: Flexible Optimizable Counterfactual Explanations for Tree Ensemblescited by 43
- 2018Unrestricted Adversarial Examplescited by 40
- 2021ReLAX: Reinforcement Learning Agent eXplainer for Arbitrary Predictive Modelscited by 25
- 2013An empirical analysis of dropout in piecewise linear networkscited by 19
- 2019Understanding Adversarial Robustness: The Trade-off between Minimum and Average Margincited by 5
Built on by
Not cited yet.