arXiv (All)
open access
Machine Unlearning for Gibbs Supervised Learning Algorithms
In this paper, a method for achieving exact unlearning for Gibbs supervised learning algorithms is proposed using a variational formulation inspired by empirical risk minimization subject to relative entropy regularization (ERM-RER). Such a method consists of maximizing the expected empirical risk o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- GFlowNets and variational inference#798523
- GFlowNets and variational inference#797110
- Full-Covariance Smoothing of Bayesian Neural Networks for Online Adaptation#1063455
- PAPT++: Risk-Aware Adversarial Tuning and Generation for Single Domain Generalization#971502
- Adam: A Method for Stochastic Optimization#6254
Record · ID 1077338
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive