mlsanityData to 7 Oct 2026

Exact Federated Continual Unlearning for Ridge Heads on Frozen Foundation Models

arXiv 2603.12977 ↗First posted 13 Mar 2026cs.LGcited by 2

On the map: LLM safety and security → Federated unlearning and poisoning

Abstract (arXiv)

Foundation models are commonly deployed as frozen feature extractors with a small trainable head to adapt to private, user-generated data in federated settings. The ``right to be forgotten'' requires removing the influence of specific samples or users from the trained model on demand. Existing federated unlearning methods target general deep models and rely on approximate reconstruction or selective retraining, making exactness costly or elusive. We study this problem in a practically relevant but under-explored regime: a frozen foundation model with a ridge-regression head. The exact optimum depends on the data only through two additive sufficient statistics, which we turn into a communication protocol supporting an arbitrary stream of add and delete requests via fixed-size messages. The server maintains a head that is, in exact arithmetic, pointwise identical to centralized retraining after every request. We provide deterministic retrain-equivalence guarantees, order and partition invariance, two server-side variants, and a Bayesian certificate of zero KL divergence. Experiments on four benchmarks confirm the guarantees: both variants match centralized ridge retraining to within 10-9 relative Frobenius error and complete each request at orders-of-magnitude lower cost than federated retraining baselines.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Federated unlearning and poisoning, one of 12 directions in LLM safety and security. Builds on 15 of its 25 references that are in the map. First posted on arXiv 13 Mar 2026.

Builds on

15 of 25 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024Communication Efficient and Provable Federated Unlearning19 Jan

Other references · 14

  1. 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2019Machine Unlearningcited by 1,020
  4. 2018LEAF: A Benchmark for Federated Settingscited by 780
  5. 2019Certified Data Removal from Machine Learning Modelscited by 512
  6. 2020Flower: A Friendly Federated Learning Research Frameworkcited by 449
  7. 2020TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classificationcited by 414
  8. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
  9. 2020Approximate Data Deletion from Machine Learning Modelscited by 250
  10. 2022ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protectioncited by 56
  11. 2023SAFE: Machine Unlearning With Shard Graphscited by 28
  12. 2024Frozen Feature Augmentation for Few-Shot Image Classificationcited by 13
2 more
  1. 2024MUSO: Achieving Exact Machine Unlearning in Over-Parameterized Regimescited by 3
  2. 2025AFCL: Analytic Federated Continual Learning for Spatio-Temporal Invariance of Non-IID Datacited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.