כתבה
arXiv cs.LG ·
Reference-Guided Machine Unlearning
תקציר מקורי באנגליתarXiv:2603.11210v2 Announce Type: replace Abstract: Machine unlearning aims to remove the influence of specific training data from a model while preserving its general utility. In vision, many approximate unlearning methods pursue this goal through degradation-based heuristics, such as loss maximization or random labeling. Yet making a model worse on forget samples is not the same as making it behave as if those examples had never been seen: these signals can be poorly conditioned, destabilize optimization, and harm generalization. We argue that approximate unlearning should instead prioritize distributional indistinguishability, aligning the model's predictive behavior on forget data with that on truly unseen data. Motivated by this principle, we propose Reference-Guided Unlearning (ReGUn
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית