Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgotten
Not on the map. Why?
Abstract (arXiv)
The Right to Explanation and the Right to be Forgotten are two important principles outlined to regulate algorithmic decision making and data usage in real-world applications. While the right to explanation allows individuals to request an actionable explanation for an algorithmic decision, the right to be forgotten grants them the right to ask for their data to be deleted from all the databases and models of an organization. Intuitively, enforcing the right to be forgotten may trigger model updates which in turn invalidate previously provided explanations, thus violating the right to explanation. In this work, we investigate the technical implications arising due to the interference between the two aforementioned regulatory principles, and propose the first algorithmic framework to resolve the tension between them. To this end, we formulate a novel optimization problem to generate explanations that are robust to model updates due to the removal of training data instances by data deletion requests. We then derive an efficient approximation algorithm to handle the combinatorial complexity of this optimization problem. We theoretically demonstrate that our method generates explanations that are provably robust to worst-case data deletion requests with bounded costs in case of linear models and certain classes of non-linear models. Extensive experimentation with real-world datasets demonstrates the efficacy of the proposed framework.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 8 Feb 2023.
Builds on
27 of 38 references.
References · 27
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2019Machine Unlearningcited by 1,020
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
- 2020Approximate Data Deletion from Machine Learning Modelscited by 250
- 2019Interpretable Counterfactual Explanations Guided by Prototypescited by 223
- 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
15 more
- 2020Multi-Objective Counterfactual Explanationscited by 157
- 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
- 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 143
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2021CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithmscited by 85
- 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
- 2018A Swiss Army Infinitesimal Jackknifecited by 51
- 2017Inverse Classification for Comparison-based Interpretability in Machine Learningcited by 49
- 2020Formalizing Data Deletion in the Context of the Right to be Forgottencited by 46
- 2020Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shiftscited by 34
- 2020An Automatic Finite-Sample Robustness Metric: When Can Dropping a Little Data Make a Big Difference?cited by 27
- 2022On the Trade-Off between Actionable Explanations and the Right to be Forgottencited by 20
- 2022Efficiently Training Low-Curvature Neural Networkscited by 19
- 2020Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable Recoursescited by 7
Built on by
Citing papers per year: 2023: 4; 2024: 4; 2025: 2.
10 papers.
- 2023Adversarial attacks and defenses in explainable artificial intelligence: A surveycited by 47
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
- 2023Fair Machine Unlearning: Data Removal while Mitigating Disparitiescited by 25
- 2023Ticketed Learning-Unlearning Schemescited by 10
- 2024Interval Abstractions for Robust Counterfactual Explanationscited by 7
- 2025Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimizationcited by 3
- 2023Towards Regulatable AI Systems: Technical Gaps and Policy Opportunitiescited by 2
- 2024Knowledge Distillation-Based Model Extraction Attack using GAN-based Private Counterfactual Explanationscited by 1
- 2024Machine Unlearning using a Multi-GAN based Modelcited by 0
- 2025MetaExplainer: A Framework to Generate Multi-Type User-Centered Explanations for AI Systemscited by 0
- 2025MetaExplainer: A Framework to Generate Multi-Type User-Centered Explanations for AI Systems1 Aug 2025
- 2025Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimization10 Jan 2025
- 2024Machine Unlearning using a Multi-GAN based Model26 Jul 2024
- 2024Interval Abstractions for Robust Counterfactual Explanations21 Apr 2024
- 2024Knowledge Distillation-Based Model Extraction Attack using GAN-based Private Counterfactual Explanations4 Apr 2024
- 2024Robust Counterfactual Explanations in Machine Learning: A Survey2 Feb 2024
- 2023Fair Machine Unlearning: Data Removal while Mitigating Disparities27 Jul 2023
- 2023Ticketed Learning-Unlearning Schemes27 Jun 2023
- 2023Towards Regulatable AI Systems: Technical Gaps and Policy Opportunities22 Jun 2023
- 2023Adversarial attacks and defenses in explainable artificial intelligence: A survey6 Jun 2023