arXiv Machine Learning By Ami Tavory, Shripad Gade, Tal Sarig, Noam Touitou, Ido Guy

Exact Unlearning via Quantized Sufficient Statistics

Read the original on arXiv Machine Learning →

The paper introduces Quantized Sufficient Statistics (QSS), a method that separates a frozen global schema from mutable, sum‑decomposable content to enable exact unlearning. QSS offers two variants: QSS‑L, which removes a label while keeping the input, and QSS‑E, which removes both input and label by learning a schema without deletable examples. Experiments on 15 vision, text, and tabular datasets show that QSS‑L achieves deletion latencies up to 483× faster than SISA while maintaining comparable accuracy, and QSS‑E quantifies the accuracy trade‑off when all traces of an input are removed.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 24

DRSR: Learning Set-Level Deletion Risk for Efficient Long-Horizon Agents

The paper introduces Direct Relational Set‑Risk Pruning (DRSR), a method for compressing the history of long‑horizon language‑model agents by selecting deletion sets based on risk constraints rather than independent unit scores. DRSR builds counterfactual supervision offline, then uses a lightweight scorer to predict set‑level harm during deployment, removing the largest safe set while respecting recency, protocol, and budget limits. Experiments on WorkBuddyBench Full260 and Eval40 show that DRSR improves mean reward from 0.699 to 0.802 and reduces token usage by over 20%, with further analyses highlighting the importance of decision‑conditioned relations, retained context, pair interactions, and abstention.

By Mingxuan Wang, Bo Wang, Fei Luo, Guorun Yao, Chao Ning, Yinglong Guo, Hongyue Chen, Yanbiao Ma, Jungong Han
arXiv Machine Learning
Sep 2

The Structure of Quantization Damage in LLMs: Why the Next Bit Should Be Spent Globally

The paper investigates where post‑training quantization (PTQ) harms large language models (LLMs) and how to best allocate a limited precision budget. By causally raising each layer to 8‑bit precision across nine open‑weight models, the authors find that quantization damage is diffuse rather than concentrated in specific task circuits or weight statistics, and that globally refining quantization granularity outperforms selectively protecting the most recoverable layers. They also observe that the residual accuracy loss is budget‑limited and that peak recovery locations correlate with architecture within families but not across families.

By Jundong Hu, Shekar Ramachandran