Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.19226

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2510.19226 (cs)
[Submitted on 22 Oct 2025 ]

Title: Controllable Machine Unlearning via Gradient Pivoting

Title: 通过梯度旋转的可控机器遗忘

Authors:Youngsik Hwang, Dong-Young Lim
Abstract: Machine unlearning (MU) aims to remove the influence of specific data from a trained model. However, approximate unlearning methods, often formulated as a single-objective optimization (SOO) problem, face a critical trade-off between unlearning efficacy and model fidelity. This leads to three primary challenges: the risk of over-forgetting, a lack of fine-grained control over the unlearning process, and the absence of metrics to holistically evaluate the trade-off. To address these issues, we reframe MU as a multi-objective optimization (MOO) problem. We then introduce a novel algorithm, Controllable Unlearning by Pivoting Gradient (CUP), which features a unique pivoting mechanism. Unlike traditional MOO methods that converge to a single solution, CUP's mechanism is designed to controllably navigate the entire Pareto frontier. This navigation is governed by a single intuitive hyperparameter, the `unlearning intensity', which allows for precise selection of a desired trade-off. To evaluate this capability, we adopt the hypervolume indicator, a metric that captures both the quality and diversity of the entire set of solutions an algorithm can generate. Our experimental results demonstrate that CUP produces a superior set of Pareto-optimal solutions, consistently outperforming existing methods across various vision tasks.
Abstract: 机器遗忘(MU)旨在从训练好的模型中移除特定数据的影响。 然而,近似遗忘方法通常被表述为单目标优化(SOO)问题,面临着遗忘效果和模型保真度之间的关键权衡。 这导致了三个主要挑战:过度遗忘的风险、对遗忘过程缺乏细粒度控制以及缺乏全面评估权衡的指标。 为了解决这些问题,我们将MU重新表述为多目标优化(MOO)问题。 然后,我们引入了一种新的算法,通过枢轴梯度进行可控遗忘(CUP),该算法具有独特的枢轴机制。 与传统MOO方法收敛到单一解不同,CUP的机制旨在可控地遍历整个帕累托前沿。 这种遍历由一个直观的超参数“遗忘强度”控制,允许精确选择所需的权衡。 为了评估这种能力,我们采用了超体积指标,该指标能够捕捉算法可以生成的所有解的质量和多样性。 我们的实验结果表明,CUP生成了一组优越的帕累托最优解,在各种视觉任务中始终优于现有方法。
Subjects: Machine Learning (cs.LG) ; Optimization and Control (math.OC)
Cite as: arXiv:2510.19226 [cs.LG]
  (or arXiv:2510.19226v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2510.19226
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Dongyoung Lim [view email]
[v1] Wed, 22 Oct 2025 04:20:24 UTC (2,303 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.OC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号