TY - GEN
T1 - Forgetting Through Transforming
T2 - 2025 IEEE/CVF International Conference on Computer Vision, ICCV 2025
AU - Guo, Qi
AU - Tian, Zhen
AU - Yao, Minghao
AU - Qi, Saiyu
AU - Qi, Yong
AU - Liu, Bingyi
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Federated Unlearning (FU) should satisfy three key requirements: a guarantee of data erasure, preservation of model utility, and reduction of unlearning time. Recent studies focus on identifying and modifying original model parameters relevant to unlearning data. While they can achieve faster unlearning, they degrade the model performance on remaining data or fail to forget unlearning data due to the difficulty in isolating specific parameters of the unlearning data. By revisiting the representation distribution of the optimal unlearning models (i.e., the retrained models), we observe that unlearning data tends to cluster within semantically related categories of remaining data. This inspired us to transform the distribution of unlearning data to fuse with similar categories in the remaining data for effective FU. Based on this insight, we propose a novel framework, named FUCRT, to achieve Federated Unlearning via Classaware Representation Transformation. FUCRT consists of two key components: (1) a transformation class identification strategy (TCI) that leverages the original model to identify appropriate transformation classes for unlearning data, and (2) a targeted transformation learning process (TTL) with cross-class fusion mechanism to ensure effective and consistent transformation. Extensive experiments on four datasets demonstrate that FUCRT not only achieves 100% of data erasure but also outperforms state-of-theart methods by an average of 2.96% and 3.78% in utility preservation under IID and Non-IID settings, respectively. Moreover, it reduces unlearning time by 19.13%\~{} 96.38%. Codes are at https://github.com/zhentian777/FUCRT.
AB - Federated Unlearning (FU) should satisfy three key requirements: a guarantee of data erasure, preservation of model utility, and reduction of unlearning time. Recent studies focus on identifying and modifying original model parameters relevant to unlearning data. While they can achieve faster unlearning, they degrade the model performance on remaining data or fail to forget unlearning data due to the difficulty in isolating specific parameters of the unlearning data. By revisiting the representation distribution of the optimal unlearning models (i.e., the retrained models), we observe that unlearning data tends to cluster within semantically related categories of remaining data. This inspired us to transform the distribution of unlearning data to fuse with similar categories in the remaining data for effective FU. Based on this insight, we propose a novel framework, named FUCRT, to achieve Federated Unlearning via Classaware Representation Transformation. FUCRT consists of two key components: (1) a transformation class identification strategy (TCI) that leverages the original model to identify appropriate transformation classes for unlearning data, and (2) a targeted transformation learning process (TTL) with cross-class fusion mechanism to ensure effective and consistent transformation. Extensive experiments on four datasets demonstrate that FUCRT not only achieves 100% of data erasure but also outperforms state-of-theart methods by an average of 2.96% and 3.78% in utility preservation under IID and Non-IID settings, respectively. Moreover, it reduces unlearning time by 19.13%\~{} 96.38%. Codes are at https://github.com/zhentian777/FUCRT.
KW - federated learning
KW - federated unlearning
UR - https://www.scopus.com/pages/publications/105044138374
U2 - 10.1109/ICCV51701.2025.00145
DO - 10.1109/ICCV51701.2025.00145
M3 - 会议稿件
AN - SCOPUS:105044138374
T3 - Proceedings of the IEEE International Conference on Computer Vision
SP - 1474
EP - 1483
BT - Proceedings - 2025 IEEE/CVF International Conference on Computer Vision, ICCV 2025
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 19 October 2025 through 23 October 2025
ER -