arXiv:2509.17241cs.LGcs.CY2025-09被引 1

让轨迹模型快速删除指定用户数据,不重训也能保精度。

TraceHiding: Scalable Machine Unlearning for Mobility Data

  • 按轨迹重要性分级打分,精准定位需删除的数据
  • 比重训快40倍,测试准确率损失极小
  • 适合隐私合规需求强的交通与位置服务应用

本文提出TraceHiding,一种可扩展的重要性感知机器遗忘框架,用于移动轨迹数据。针对GDPR、CCPA等法规赋予用户的“被遗忘权”,该方法可在不全量重训的前提下,从深度模型中移除特定用户轨迹。其核心是基于统计特性(覆盖多样性、熵、长度)在令牌、轨迹和用户三个层级计算重要性得分,量化训练样本影响,实现对高影响力数据的定向遗忘,同时保留共性模式。学生模型通过重要性加权损失函数,在保留其余数据知识的同时,强化对独特样本的遗忘信号,弱化对高频样本的影响。在三个真实高阶移动数据集(HO-Rome、HO-Geolife、HO-NYC)及多种架构(GRU、LSTM、BERT、ModernBERT、GCN-TULHOR)上验证,对比SCRUB、NegGrad、NegGrad+、Bad-T、Finetuning等强基线,结果显示,尤其基于熵的变体在统一与针对性用户删除场景下均实现更高遗忘精度、媲美重训的成员推断攻击防御能力,且速度提升最高达40倍,测试精度损失微乎其微。结果表明对高信息量用户恶意删除也具鲁棒性,跨模型表现一致。据我们所知,这是首个系统研究轨迹数据机器遗忘的工作,提供可复现的代码与预处理工具。

原文摘要 · Abstract (English)

This work introduces TraceHiding, a scalable, importance-aware machine unlearning framework for mobility trajectory data. Motivated by privacy regulations such as GDPR and CCPA granting users "the right to be forgotten," TraceHiding removes specified user trajectories from trained deep models without full retraining. It combines a hierarchical data-driven importance scoring scheme with teacher-student distillation. Importance scores--computed at token, trajectory, and user levels from statistical properties (coverage diversity, entropy, length)--quantify each training sample's impact, enabling targeted forgetting of high-impact data while preserving common patterns. The student model retains knowledge on remaining data and unlearns targeted trajectories through an importance-weighted loss that amplifies forgetting signals for unique samples and attenuates them for frequent ones. We validate on Trajectory--User Linking (TUL) tasks across three real-world higher-order mobility datasets (HO-Rome, HO-Geolife, HO-NYC) and multiple architectures (GRU, LSTM, BERT, ModernBERT, GCN-TULHOR), against strong unlearning baselines including SCRUB, NegGrad, NegGrad+, Bad-T, and Finetuning. Experiments under uniform and targeted user deletion show TraceHiding, especially its entropy-based variant, achieves superior unlearning accuracy, competitive membership inference attack (MIA) resilience, and up to 40\times speedup over retraining with minimal test accuracy loss. Results highlight robustness to adversarial deletion of high-information users and consistent performance across models. To our knowledge, this is the first systematic study of machine unlearning for trajectory data, providing a reproducible pipeline with public code and preprocessing tools.

机器遗忘轨迹数据隐私保护高效推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。