CULypso:面向车联网的分层联邦遗忘算法
CULypso: A Clustered Federated Unlearning paradigm for Vehicular Ad-Hoc Networks
做车联网或边缘学习的人可以看看这篇:VANET 里怎么按法规删除某个客户端的数据影响。相比 FedEraser,时间、存储和保真度综合好约 65%,比整模重训省得多,思路是用车辆集群分层擦除。
arXiv 上发布的论文 CULypso 提出一种针对车载自组织网络(VANETs)的分层联邦遗忘(Federated Unlearning)范式,用于响应数据保护法规中对数据删除权的要求。算法针对高移动性、时间敏感的车联网场景设计,利用车辆集群的拓扑和移动特性,将指定客户端对全局模型的影响进行擦除。
实验结果显示,与基线方法 FedEraser 相比,CULypso 在时间开销、服务器存储负载和遗忘保真度三项指标上综合提升约 65%,并大幅优于完整重训练方案。论文将这类边缘场景下的非平凡遗忘任务视为此前 largely unexplored 的挑战,通过近似、外科手术式的分层擦除降低通信与资源成本。
CULypso: A Clustered Federated Unlearning paradigm for Vehicular Ad-Hoc Networks
Unlearning has emerged as an essential security and privacy-preserving solution in Machine Learning, enabling networks to support their clients' rights for data erasure, as mandated by data protection regulations. Introducing such a non-trivial task to an edge, highly mobile and time-sensitive vehicular network is an even greater, largely unexplored challenge. This article argues that a hierarchical Federated Unlearning approach could be aptly integrated into vehicular ad-hoc networks (VANETs), leveraging topology and movement to reduce communication, resource and time costs, while effectively forgetting a client's influence on the global model updates. In order to achieve this, we propose CULypso, an approximate, surgical, hierarchical unlearning algorithm tailored for clustered VANETs. Inspired by the nymph in Greek mythology, Calypso, whose name translates to 'she who conceals the knowledge', CULypso, with the capital letters referencing \textbf{C}lustered \textbf{U}n\textbf{L}earning, aims to achieve exactly what its name suggests: conceal, erase or forget in our case, knowledge it contains. Extensive experiments uphold the potency of our paradigm with it performing approximately 65\% better than FedEraser in terms of time, server storage load, and unlearning fidelity while utterly outperforming baseline full retraining.
本条情报归属 AITOP「论文」核心追踪栏目。涉及核心实体与技术议题包括:Federated Unlearning、VANET、FedEraser、数据隐私,读者可通过下方标签进入对应专题页查阅历史脉络与关联对比。
信源核验说明:本文原始线索采编自「arXiv cs.AI」(@Eleftheria Chini, George Margaritis, Dimitrios Katsaros),经 AITOP 多维评分管线结构化提炼。