The latest research from Google
Jun 10, 2026
New framework for auditing machine unlearning · The latest research from Google
Science, Technology & Innovation · Jun 10, 2026
Google introduces a relative three-sample audit using regularized f-divergence kernel tests that adaptively chooses divergences and hyperparameters to decide whether an unlearned model is closer to a safely retrained model or the original compromised model, yielding tractable high-dimensional tests, controlled false positives at any sample size, vanishing false negatives with more data, and less manual tuning than MMD-based approaches.
New framework for auditing machine unlearning · The latest research from Google
Science, Technology & Innovation · Jun 10, 2026
A broad empirical study using a three-sample relative audit finds most approximate machine-unlearning methods fail to truly forget—only the random-label technique passed—though the authors stress these simplified implementations are an evaluation signal, not a production ranking, and that audit methodology can change perceived deployability.
New framework for auditing machine unlearning · The latest research from Google
Science, Technology & Innovation · Jun 10, 2026
Two-sample auditing for machine unlearning is both computationally costly and structurally unreliable: comparing an unlearned model’s outputs to an independently retrained model can confuse harmless retraining variation or inevitable residual footprints from local unlearning updates with privacy failures, so exact distributional matching should not be the default compliance criterion.
New framework for auditing machine unlearning · The latest research from Google
Science, Technology & Innovation · Jun 10, 2026
The paper demonstrates a large sample-efficiency improvement in differential-privacy auditing—detecting a violation in the SVT3 sparse vector mechanism with only a few thousand samples versus millions previously—by using hockey-stick divergence (aligned with pure DP) and an adaptive testing framework, which cuts hyperparameter tuning, lowers computational burden, and could make routine, earlier, and more frequent privacy audits feasible if the result generalizes.