Mo' Memory, Mo' Problems: Stream-Native Machine Unlearning

Kennon Stewart
8/13/2025
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Machine unlearning work assumes a static, i.i.d training environment that doesn't truly exist. Modern ML pipelines need to learn, unlearn, and predict continuously on production streams of data. We translate batch unlearning to the online setting using notions of regret, sample complexity, and deletion capacity. We tighten regret bounds to a logarithmic $\mathcal{O}(\ln{T})$, a first for a certified unlearning algorithm. When fitted with an online variant of L-BFGS optimization, the algorithm achieves state of the art regret with a constant memory footprint. Such changes extend the lifespan of an ML model before expensive retraining, making for a more efficient unlearning process.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{stewart2025memory,
  title  = {Mo' Memory, Mo' Problems: Stream-Native Machine Unlearning},
  author = {Kennon Stewart},
  year   = {2025},
  eprint = {2508.10193},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.10193v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.10193.svg)](https://codeofpaper.com/paper/2508.10193)

Discussion