arXiv (All)
open access
Exact Unlearning via Quantized Sufficient Statistics
Exact unlearning requires a deployed predictor to match one rebuilt without the information named by a deletion request. Existing general-purpose exact methods localize retraining through disjoint shards, but every request still invalidates a model, and smaller shards reduce the data available to ea
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
- Class Machine Unlearning for Complex Data via Concepts Inference and Data Poisoning#1247237
- How unconstrained machine-learning models learn physical symmetries#415179
- Faultless: A Program Equivalence Technique for Validating and Evaluating Neural Decompilers#1119162
- Faultless: A Program Equivalence Technique for Validating and Evaluating Neural Decompilers#1108843
- Efficient Test-Time Finetuning of LLMs via Convex Reconstruction and Gradient Caching#238592
Record · ID 1216572
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