mlsanityData to 14 Oct 2026

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

arXiv 2508.10193 ↗First posted 13 Aug 2025stat.ML cs.LGcited by 0

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

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 O(lnT), 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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 11 of its 16 references that are in the map. First posted on arXiv 13 Aug 2025.

Builds on

11 of 16 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025When to Forget? Complexity Trade-offs in Machine Unlearning24 Feb
  2. 2024Hessian-Free Online Certified Unlearning2 Apr
  3. 2021Adaptive Machine Unlearning8 Jun
  4. 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar

Other references · 7

  1. 2019Certified Data Removal from Machine Learning Modelscited by 535
  2. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
  3. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
  4. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
  5. 2014A Stochastic Quasi-Newton Method for Large-Scale Optimizationcited by 69
  6. 2015A Linearly-Convergent Stochastic L-BFGS Algorithmcited by 39
  7. 2014Global Convergence of Online Limited Memory BFGScited by 18

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Machine Unlearning for Streaming Forgetting
  2. 2025Online Learning and Unlearning
  3. 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning
  4. 2026Form and Function: Machine Unlearning as a Problem of Misaligned States
  5. 2025On the Impossibility of Retrain Equivalence in Machine Unlearning
  6. 2026Efficient machine unlearning with minimax optimality
  7. 2025Efficient Machine Unlearning by Model Splitting and Core Sample Selection
  8. 2022Algorithms that Approximate Data Removal: New Results and Limitations