Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.26714 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917176642895872 |
|---|---|
| author | Lanyon, Jamie Finke, Axel Andreou, Petros Cosma, Georgina |
| author_facet | Lanyon, Jamie Finke, Axel Andreou, Petros Cosma, Georgina |
| contents | Machine unlearning (MU) aims to remove the influence of certain data points from a trained model without costly retraining. Most practical MU algorithms are only approximate and their performance can only be assessed empirically. Care must therefore be taken to make empirical comparisons as representative as possible. A common practice is to run the MU algorithm multiple times independently starting from the same trained model. In this work, we demonstrate that this practice can give highly non-representative results because -- even for the same architecture and same dataset -- some MU methods can be highly sensitive to the choice of random number seed used for model training. We illustrate that this is particularly relevant for MU methods that are deterministic, i.e., which always produce the same result when started from the same trained model. We therefore recommend that empirical comparisons of MU algorithms should also reflect the variability across different model training seeds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_26714 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the limitation of evaluating machine unlearning using only a single training seed Lanyon, Jamie Finke, Axel Andreou, Petros Cosma, Georgina Machine Learning Artificial Intelligence Machine unlearning (MU) aims to remove the influence of certain data points from a trained model without costly retraining. Most practical MU algorithms are only approximate and their performance can only be assessed empirically. Care must therefore be taken to make empirical comparisons as representative as possible. A common practice is to run the MU algorithm multiple times independently starting from the same trained model. In this work, we demonstrate that this practice can give highly non-representative results because -- even for the same architecture and same dataset -- some MU methods can be highly sensitive to the choice of random number seed used for model training. We illustrate that this is particularly relevant for MU methods that are deterministic, i.e., which always produce the same result when started from the same trained model. We therefore recommend that empirical comparisons of MU algorithms should also reflect the variability across different model training seeds. |
| title | On the limitation of evaluating machine unlearning using only a single training seed |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2510.26714 |