TY - GEN
T1 - Right-to-be-Forgotten by Design in Adapter-Tuned Transformers
AU - Ranade, D. J.
AU - Jaiswal, Rajesh
N1 - Publisher Copyright:
© 2026 Copyright held by the owner/author(s).
PY - 2026/2/16
Y1 - 2026/2/16
N2 - Enforcing the Right-to-be-Forgotten (RtBF) in transformer models remains challenging: full retraining is costly, while post-hoc unlearning often leaves residual signal without guarantees. We propose an RtBF-by-design protocol for adapter-tuned models that combines differential privacy (DP) applied to Low-Rank Adaptation (LoRA) adapters with a matched-control Deletion Sufficiency Certificate (DSC). A DP-trained model on the full dataset is evaluated against an identically configured and trained redacted-control model using three complementary criteria - prediction agreement, membership-inference separability, and calibrated confidence exposure - to assess deletion sufficiency. The DSC offers an operational go/no-go decision for RtBF without requiring full retraining. Experiments on a text classification task show that multiple privacy budgets (e.g., e {5, 6, 8}) preserve near-baseline utility while meeting all deletion sufficiency criteria, whereas post-hoc unlearning baselines either degrade utility or exhibit strong residual leakage. The protocol provides a lightweight, reproducible pathway to RtBF compliance in adapter-based fine-tuning.
AB - Enforcing the Right-to-be-Forgotten (RtBF) in transformer models remains challenging: full retraining is costly, while post-hoc unlearning often leaves residual signal without guarantees. We propose an RtBF-by-design protocol for adapter-tuned models that combines differential privacy (DP) applied to Low-Rank Adaptation (LoRA) adapters with a matched-control Deletion Sufficiency Certificate (DSC). A DP-trained model on the full dataset is evaluated against an identically configured and trained redacted-control model using three complementary criteria - prediction agreement, membership-inference separability, and calibrated confidence exposure - to assess deletion sufficiency. The DSC offers an operational go/no-go decision for RtBF without requiring full retraining. Experiments on a text classification task show that multiple privacy budgets (e.g., e {5, 6, 8}) preserve near-baseline utility while meeting all deletion sufficiency criteria, whereas post-hoc unlearning baselines either degrade utility or exhibit strong residual leakage. The protocol provides a lightweight, reproducible pathway to RtBF compliance in adapter-based fine-tuning.
KW - Differential Privacy
KW - HCAI
KW - Machine Unlearning
KW - Parameter-Efficient Fine-Tuning (PEFT)
KW - Right-to-be-Forgotten (RtBF)
UR - https://www.scopus.com/pages/publications/105031778584
U2 - 10.1145/3777490.3777507
DO - 10.1145/3777490.3777507
M3 - Conference contribution
AN - SCOPUS:105031778584
T3 - HCAI-ep 2026 - Proceedings of the 2026 Conference on Human Centered Artificial Intelligence - Education and Practice
SP - 93
EP - 99
BT - HCAI-ep 2026 - Proceedings of the 2026 Conference on Human Centered Artificial Intelligence - Education and Practice
PB - Association for Computing Machinery (ACM)
T2 - 3rd International Conference on Human-Centred AI - Education and Practice, HCAI-ep 2026
Y2 - 21 January 2026 through 22 January 2026
ER -