待翻译：When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs

AI 服务暂时不可用，以下为来源正文，待恢复后补全翻译。

content type paperpublished August 2026 When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs AuthorsUdi Wieder, Vitaly Feldman, Robert Fisher, Anat Kleiman† View publication As concerns around data privacy in machine learning grow, the ability to unlearn, or remove, specific data points from trained models becomes increasingly important. While state of the art unlearning methods have emerged in response, they typically treat all points in the forget set equally. In this work, we challenge this approach by asking whether points that have a negligible impact on the model’s learning need to be removed. Through a comparative analysis of influence functions across language and vision tasks, we identify subsets of training data with negligible impact on model outputs. Leveraging this insight, we propose an efficient unlearning framework that reduces the size of datasets before unlearning leading to significant computational savings (up to approximately 50 percent) on real world empirical examples. † Harvard Work done while at Apple When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs July 17, 2026research area Data Science and Annotation, research area Privacy As concerns around data privacy in machine learning grow, the ability to unlearn—or remove—specific data points from trained models becomes increasingly important. While state-of-the-art unlearning methods have emerged in response, they typically treat all points in the forget set equally. In this work, we challenge this approach by asking: do points that have a negligible impact on the model’s learning need to be removed? Through a comparative… Read more Subspace Recovery from Heterogeneous Data with Non-isotropic Noise November 10, 2022research area Methods and Algorithms, research area Privacyconference NeurIPS *= Equal Contributions Recovering linear subspaces from data is a fundamental and important task in statistics and machine learning. Motivated by heterogeneity in Federated Learning settings, we study a basic formulation of this problem: the principal component analysis (PCA), with a focus on dealing with irregular noise. Our data come from nnn users with user iii contributing data samples from a ddd-dimensional distribution with mean μi\mu_iμi​… Read more