Modeling Deletion Requests in Machine Unlearning
cs.LG, cs.CR, cs.CY
Submitted: 2026-10-03
Updated: 2026-10-03
Comments: 17 pages, 7 figures
Code: https://github.com/chriscianfarani/ModelingDeletionRequests
License: http://creativecommons.org/licenses/by/4.0/
The gist: Machine unlearning is seen as a promising approach to enable users to exercise the "right to erasure" in the context of AI models.
Terminology
Abstract
Machine unlearning is seen as a promising approach to enable users to exercise the "right to erasure" in the context of AI models. We ask how users might influence the behavior of models when exercising this right. We define two types of behaviors that users might adopt when requesting the deletion of their data: adaptivity and collectivity. Drawing connections between the goals of users in this context and results in stochastic optimization, we demonstrate theoretical gaps between the potential effects of groups of users who do and do not display these behaviors. We then show how techniques from data valuation might be used to design deletion requesters that can significantly alter model behavior in realistic settings. In experiments on computer vision tasks, we demonstrate the differential effects of different models of user behavior and attempt to isolate the impacts of adaptivity and collectivity.
Sources
- Certified Data Removal from Machine Learning Models
- Protecting the Undeleted in Machine Unlearning
- Corrective Machine Unlearning
- Editing Models with Task Arithmetic
- What is Your Data Worth to GPT? LLM-Scale Data Valuation with Influence Functions
- Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
- Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks