Sign inGet started
Paper · arXiv

Form and Function: Machine Unlearning as a Problem of Misaligned States

We formulate machine unlearning for online L-BFGS as a counterfactual state-alignment problem. Given an actual event stream and a deletion-edited counterfactual stream, the target of unlearning is the optimizer state that would have arisen had the deleted samples never been processed. We introduce state-aware metrics that separately measure parameter error, memory-operator error, combined state error, and update-direction error. The memory metric compares the inverse-Hessian actions induced by the o-L-BFGS memory, rather than treating curvature pairs as of finite influence. Under convexity assumptions, we derive a recursive bound on counterfactual state deviation. We then evaluate a state...

AuthorsKennon Stewart
Primary categorycs.LG
Published17 May 2026
Last updated at source17 May 2026
cs.LGmath.OC
Embed this entry
<iframe src="https://silytics.si/embed/item/cd70967c-6470-4f64-b826-a96d620073ad" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.