MobText-SISA: Efficient Machine Unlearning for Mobility Logs with Spatio-Temporal and Natural-Language Data

• URL: http://arxiv.org/abs/2508.19554v1
• Date: Wed, 27 Aug 2025 03:55:16 GMT
• Title: MobText-SISA: Efficient Machine Unlearning for Mobility Logs with Spatio-Temporal and Natural-Language Data
• Abstract summary: We introduce MobText-SISA, a scalable machine-unlearning framework that extends Sharded, Isolated Slice, and AggregatedSIS (A) training to heterogeneous-temporal data.<n>We show that MobText-SISA consistently outperforms random sharding in both error and convergence speed.<n>These results establish MobText-SISA as a practical foundation for privacy-compliant analytics on mobility data at urban scale.
• Score: 6.013377534625831
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern mobility platforms have stored vast streams of GPS trajectories, temporal metadata, free-form textual notes, and other unstructured data. Privacy statutes such as the GDPR require that any individual's contribution be unlearned on demand, yet retraining deep models from scratch for every request is untenable. We introduce MobText-SISA, a scalable machine-unlearning framework that extends Sharded, Isolated, Sliced, and Aggregated (SISA) training to heterogeneous spatio-temporal data. MobText-SISA first embeds each trip's numerical and linguistic features into a shared latent space, then employs similarity-aware clustering to distribute samples across shards so that future deletions touch only a single constituent model while preserving inter-shard diversity. Each shard is trained incrementally; at inference time, constituent predictions are aggregated to yield the output. Deletion requests trigger retraining solely of the affected shard from its last valid checkpoint, guaranteeing exact unlearning. Experiments on a ten-month real-world mobility log demonstrate that MobText-SISA (i) sustains baseline predictive accuracy, and (ii) consistently outperforms random sharding in both error and convergence speed. These results establish MobText-SISA as a practical foundation for privacy-compliant analytics on multimodal mobility data at urban scale.

Related papers

• InfoAtlas: A Foundation Model for Zero-Shot Statistical Dependence Estimate [68.14572758582081]
  InfoAtlas is a foundation model-like architecture that eliminates the need for iterative optimization.<n>It learns to identify diverse dependence structures and predict MI directly from the dataset.<n>Experiments demonstrate that InfoAtlas matches state-of-the-art neural estimators in accuracy while achieving $100times$ speedup.
  arXiv  Detail & Related papers  (2026-05-29T18:16:51Z)
• STAP: A Shuffle-Tokenized App Predictor with Ultra Long Context for Vocabulary-Free Mobile App Prediction [3.5809657956404135]
  Existing models rely on fixed app vocabularies, which prevents them from generalizing across different app ecosystems.<n>We propose STAP, a Transformer-based model that eliminates the need for a fixed vocabulary.<n>Experiments on two datasets from different continents demonstrate that STAP achieves strong cross-dataset zero-shot prediction accuracy.
  arXiv  Detail & Related papers  (2026-05-28T12:44:54Z)
• Learning Individual Dynamics from Sparse Cross-Sectional Snapshots [5.850296173420883]
  We introduce CADENCE, a principled probabilistic framework that recovers continuous individual trajectories from isolated snapshots.<n>We provide novel identifiability guarantees for single-timepoint trajectory.<n>CADENCE matches or exceeds the performance of state-of-the-art sequential models trained on dense, full-trajectory data.
  arXiv  Detail & Related papers  (2026-05-22T10:29:47Z)
• Unsupervised Continual Learning for Amortized Bayesian Inference [7.052272974286418]
  Amortized Bayesian Inference (ABI) enables efficient posterior estimation using generative neural networks trained on simulated data.<n>Current approaches are limited to static, single-task settings and fail to handle sequentially arriving data or distribution shifts.<n>We propose a continual learning framework for ABI that decouples simulation-based pre-training from unsupervised sequential SC fine-tuning on real-world data.
  arXiv  Detail & Related papers  (2026-02-26T11:22:46Z)
• ESPADA: Execution Speedup via Semantics Aware Demonstration Data Downsampling for Imitation Learning [18.435889278351297]
  ESPADA is a semantically aware framework that segments demonstrations using a VLM-LLM pipeline with 3D gripper-object relations.<n>To scale from a single annotated episode to the full dataset, ESPADA propagates segment labels via Dynamic Time Warping.<n> ESPADA achieves approximately a 2x speed-up while maintaining success rates, narrowing the gap between human demonstrations and efficient robot control.
  arXiv  Detail & Related papers  (2025-12-08T10:08:33Z)
• TraceHiding: Scalable Machine Unlearning for Mobility Data [1.6042394978941517]
  TraceHiding is a scalable, importance-aware machine unlearning framework for mobility trajectory data.<n>It removes specified user trajectories from trained deep models without full retraining.<n>It achieves superior unlearning accuracy, competitive membership inference attack (MIA) resilience, and up to 40times speedup over retraining.
  arXiv  Detail & Related papers  (2025-09-21T21:29:24Z)
• MIRRAMS: Learning Robust Tabular Models under Unseen Missingness Shifts [2.5357049657770516]
  Missing values often reflect variations in data collection policies, which may shift across time or locations.<n>Such shifts in the missingness distribution between training and test inputs pose a significant challenge to achieving robust predictive performance.<n>We propose a novel deep learning framework designed to address this challenge, particularly in the common yet challenging scenario where the test-time dataset is unseen.
  arXiv  Detail & Related papers  (2025-07-11T03:03:30Z)
• STSA: Federated Class-Incremental Learning via Spatial-Temporal Statistics Aggregation [64.48462746540156]
  Federated Class-Incremental Learning (FCIL) enables Class-Incremental Learning from distributed data.<n>We propose a novel approach to aggregate feature statistics both spatially (across clients) and temporally (across stages)<n>We show that our method outperforms state-of-the-art FCIL methods in terms of performance, flexibility, and both communication and efficiency.
  arXiv  Detail & Related papers  (2025-06-02T05:14:57Z)
• Spatial-Temporal-Spectral Unified Modeling for Remote Sensing Dense Prediction [20.1863553357121]
  Current deep learning architectures for remote sensing are fundamentally rigid.<n>We introduce the Spatial-Temporal-Spectral Unified Network (STSUN) for unified modeling.<n> STSUN can adapt to input and output data with arbitrary spatial sizes, temporal lengths, and spectral bands.<n>It unifies various dense prediction tasks and diverse semantic class predictions.
  arXiv  Detail & Related papers  (2025-05-18T07:39:17Z)
• Rethinking Irregular Time Series Forecasting: A Simple yet Effective Baseline [12.66709671516384]
  We introduce APN, a general and efficient forecasting framework.<n>At the core of APN is a novel Time-Aware Patch Aggregation (ATAPA) module.<n>It computes patch representations via a time-aware weighted aggregation of all raw observations.<n>This approach provides two key advantages: it preserves data fidelity by avoiding the introduction of artificial data points and ensures complete information coverage by design.
  arXiv  Detail & Related papers  (2025-05-16T13:42:00Z)
• Detecting Training Data of Large Language Models via Expectation Maximization [62.28028046993391]
  We introduce EM-MIA, a novel membership inference method that iteratively refines membership scores and prefix scores via an expectation-maximization algorithm.<n> EM-MIA achieves state-of-the-art results on WikiMIA.
  arXiv  Detail & Related papers  (2024-10-10T03:31:16Z)
• PeFAD: A Parameter-Efficient Federated Framework for Time Series Anomaly Detection [51.20479454379662]
  We propose a. Federated Anomaly Detection framework named PeFAD with the increasing privacy concerns. We conduct extensive evaluations on four real datasets, where PeFAD outperforms existing state-of-the-art baselines by up to 28.74%.
  arXiv  Detail & Related papers  (2024-06-04T13:51:08Z)
• CTP: Towards Vision-Language Continual Pretraining via Compatible Momentum Contrast and Topology Preservation [128.00940554196976]
  Vision-Language Continual Pretraining (VLCP) has shown impressive results on diverse downstream tasks by offline training on large-scale datasets. To support the study of Vision-Language Continual Pretraining (VLCP), we first contribute a comprehensive and unified benchmark dataset P9D. The data from each industry as an independent task supports continual learning and conforms to the real-world long-tail nature to simulate pretraining on web data.
  arXiv  Detail & Related papers  (2023-08-14T13:53:18Z)
• SARN: Structurally-Aware Recurrent Network for Spatio-Temporal Disaggregation [8.636014676778682]
  Open data is frequently released spatially aggregated, usually to comply with privacy policies. But coarse, heterogeneous aggregations complicate coherent learning and integration for downstream AI/ML systems. We propose an overarching model named Structurally-Aware Recurrent Network (SARN), which integrates structurally-aware spatial attention layers into the Gated Recurrent Unit (GRU) model. For scenarios with limited historical training data, we show that a model pre-trained on one city variable can be fine-tuned for another city variable using only a few hundred samples.
  arXiv  Detail & Related papers  (2023-06-09T21:01:29Z)
• Transform-Equivariant Consistency Learning for Temporal Sentence Grounding [66.10949751429781]
  We introduce a novel Equivariant Consistency Regulation Learning framework to learn more discriminative representations for each video. Our motivation comes from that the temporal boundary of the query-guided activity should be consistently predicted. In particular, we devise a self-supervised consistency loss module to enhance the completeness and smoothness of the augmented video.
  arXiv  Detail & Related papers  (2023-05-06T19:29:28Z)
• One-Shot Domain Adaptive and Generalizable Semantic Segmentation with Class-Aware Cross-Domain Transformers [96.51828911883456]
  Unsupervised sim-to-real domain adaptation (UDA) for semantic segmentation aims to improve the real-world test performance of a model trained on simulated data. Traditional UDA often assumes that there are abundant unlabeled real-world data samples available during training for the adaptation. We explore the one-shot unsupervised sim-to-real domain adaptation (OSUDA) and generalization problem, where only one real-world data sample is available.
  arXiv  Detail & Related papers  (2022-12-14T15:54:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.