FG-OrIU: Towards Better Forgetting via Feature-Gradient Orthogonality for Incremental Unlearning
Qian Feng, JiaHang Tu, Mintong Kang, Hanbin Zhao, Chao Zhang, Hui Qian
TL;DR
FG-OrIU addresses incremental unlearning in vision pre-trained models by enforcing orthogonality constraints on both feature representations and gradient updates. It uses Singular Value Decomposition to partition feature spaces into forgetting and remaining subspaces, and deploys a three-stage framework: feature subspace decomposition, dual orthogonal projection, and dynamic subspace adaptation, all implemented with LoRA-based lightweight updates. The method demonstrates superior forgetting effectiveness while preserving retained performance across MU and IU benchmarks, supported by ablations and analysis showing deeper forgetting and reduced recoverability. This approach enhances post-deletion reliability and scalability for vision PTMs under evolving data-forgetting policies.
Abstract
Incremental unlearning (IU) is critical for pre-trained models to comply with sequential data deletion requests, yet existing methods primarily suppress parameters or confuse knowledge without explicit constraints on both feature and gradient level, resulting in \textit{superficial forgetting} where residual information remains recoverable. This incomplete forgetting risks security breaches and disrupts retention balance, especially in IU scenarios. We propose FG-OrIU (\textbf{F}eature-\textbf{G}radient \textbf{Or}thogonality for \textbf{I}ncremental \textbf{U}nlearning), the first framework unifying orthogonal constraints on both features and gradients level to achieve deep forgetting, where the forgetting effect is irreversible. FG-OrIU decomposes feature spaces via Singular Value Decomposition (SVD), separating forgetting and remaining class features into distinct subspaces. It then enforces dual constraints: feature orthogonal projection on both forgetting and remaining classes, while gradient orthogonal projection prevents the reintroduction of forgotten knowledge and disruption to remaining classes during updates. Additionally, dynamic subspace adaptation merges newly forgetting subspaces and contracts remaining subspaces, ensuring a stable balance between removal and retention across sequential unlearning tasks. Extensive experiments demonstrate the effectiveness of our method.
