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:2106.00265v1

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2106.00265v1 (cs)
[Submitted on 1 Jun 2021 ]

Title: A unified PAC-Bayesian framework for machine unlearning via information risk minimization

Title: 通过信息风险最小化进行机器遗忘的统一PAC-Bayesian框架

Authors:Sharu Theresa Jose, Osvaldo Simeone
Abstract: Machine unlearning refers to mechanisms that can remove the influence of a subset of training data upon request from a trained model without incurring the cost of re-training from scratch. This paper develops a unified PAC-Bayesian framework for machine unlearning that recovers the two recent design principles - variational unlearning (Nguyen et.al., 2020) and forgetting Lagrangian (Golatkar et.al., 2020) - as information risk minimization problems (Zhang,2006). Accordingly, both criteria can be interpreted as PAC-Bayesian upper bounds on the test loss of the unlearned model that take the form of free energy metrics.
Abstract: 机器遗忘指的是能够在不重新从头训练的情况下,移除受训模型中一部分训练数据影响的机制。 本文开发了一个统一的PAC-Bayesian框架用于机器遗忘,该框架将两种最近的设计原则 - 变分遗忘(Nguyen等,2020)和遗忘拉格朗日 (Golatkar等,2020) - 作为信息风险最小化问题 (Zhang,2006)。 因此,这两种标准都可以解释为未遗忘模型测试损失的PAC-Bayesian上界,其形式为自由能度量。
Comments: Under Review
Subjects: Machine Learning (cs.LG) ; Information Theory (cs.IT); Signal Processing (eess.SP)
Cite as: arXiv:2106.00265 [cs.LG]
  (or arXiv:2106.00265v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2106.00265
arXiv-issued DOI via DataCite

Submission history

From: Sharu Theresa Jose [view email]
[v1] Tue, 1 Jun 2021 06:55:37 UTC (181 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2021-06
Change to browse by:
cs
cs.IT
eess
eess.SP
math
math.IT

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号