Forgetting to Improve: Principled Data Removal in Active Learning
Organizations: ETH Zürich · University of Cambridge · Karolinska Institutet
Abstract
The uncertainty of a statistical model is most commonly factorized into an aleatoric and an epistemic part. This factorization changes how predictions are interpreted in downstream decision tasks. Importantly, except for the idealistic scenario with no model mismatch, the quantification is a characteristic of the model and not the data generating process. In this paper, we propose Forgetting to Improve a method that reduces this discrepancy by incorporating the task into the modeling framework. Our key insight is to acknowledge that in scenarios of model mismatch, data can have a detrimental effect on the modeling for a specific task. Based on this insight, we propose an influence function for Gaussian process models that allows for principled removal of detrimental data samples. We showcase the flexibility of this approach by demonstrating significant improvements across a range of tasks, including Bayesian optimization, model-based reinforcement learning, and transductive learning.
Figures & tables
Appendix figures & tables23 assets
Supplementary material from the paper’s appendix.
Appendix
| Homoscedastic GP | Target Sampling | Relevance Pursuit | Warped GP | Heteroscedastic GP | F2I | ||
|---|---|---|---|---|---|---|---|
| Dow Jones | MSE | ||||||
| MAE | |||||||
| NLL | |||||||
| CE | |||||||
| ECE | |||||||
| Sharpness |
| Setting | Dow Jones | Boston Housing | Symmetric LS | Asymmetric LS | Yacht | CASP |
|---|---|---|---|---|---|---|
| limits | ||||||
| limits | ||||||
| Function | Dim. | Domain | Optimum | Optimizer |
|---|---|---|---|---|
| Ackley | 2 | |||
| Ackley | 6 | |||
| A. Rosenbrock | 4 | (1,…, 1) | ||
| Branin | 2 | |||
| Griewank | 2 | |||
| Holder Table | 2 |
Active Learning
Active learning selects the examples, labels, features, or experiments most useful for improving a model under limited budgets.
See all 322 papersGoal-Oriented Influence-Maximizing Data Acquisition for Learning and Optimization
We Should Distinguish Unlearning From Untraining
delete'' specific data points or behaviours from a trained model, a goal referred to as machine unlearning''. We argue that the umbrella term unlearning'' actually spans two distinct problem formulations, but the distinction between them has not yet been observed in literature. This causes ambiguity around when an unlearning algorithm is expected to work, leads to the use of inappropriate metrics and baselines when comparing algorithms to one another, difficulty in interpreting results, and missed opportunities for pursuing critical research directions. In this paper, we argue for the position that a fundamental distinction must be made between two notions that we refer to as unlearning and untraining. On one hand, untraining aims to reverse the effect of having trained on a given forget set'', i.e. to remove the influence that that specific set of examples had on the model during training. On the other hand, unlearning aims not just to remove the influence of those given examples, but also of the entire underlying subdistribution from which they were sampled (and thus e.g. the concept or model behaviour that those examples represent). We discuss technical definitions of these problems and map problem settings studied in the literature to each notion. By disambiguating technical definitions, our work aims to accelerate progress in this important field.