arXiv AI

PrivateHub: Contrastive Diffusion Model for Private Sensor-Intensive Environment Data Generation

PrivateHub is a contrastive diffusion model designed to generate synthetic multi‑sensor data that protects private user activities while keeping non‑private applications detectable. It operates in two stages: App‑Conditioned Pre‑training, which conditions the model on application embeddings, and App‑Aware Fine‑tuning, which uses contrastive learning to separate private from non‑private data. Experiments on three real‑world datasets demonstrate that PrivateHub reduces private‑application inference accuracy by 40–50% without harming non‑private performance and remains robust even when attackers retrain on the synthetic data.

arXiv AI
Aug 18

Privacy-Preserving Decentralized Federated Learning via Explainable Adaptive Differential Privacy

arXiv:2509. 10691v3 Announce Type: replace-cross Abstract: Decentralized federated learning enables collaborative model training without a central server, but shared model updates can still leak sensitive information through inversion, reconstruction, and membership inference attacks.

By Fardin Jalil Piran, Zhiling Chen, Yang Zhang, Qianyu Zhou, Jiong Tang, Farhad Imani
Hugging Face Trending Papers
Jun 1

IntraShuffler: A Privacy Preserving Framework for Heterogeneous DP Federated Learning

Heterogeneous Differential Privacy (HDP) in Federated Learning (FL) allows clients to select individual privacy budgets ($\varepsilon_i$) according to institutional policies and data sensitivity. In practice, many HDP-FL systems employ $\varepsilon$-aware server aggregation to improve model utility by re-weighting client updates according to their declared privacy budgets.

arXiv Machine Learning
Jul 23

Differentially Private Neural Network Training Under the Hidden State Assumption

arXiv:2407. 08233v3 Announce Type: replace Abstract: Current differentially private learning paradigms face a severe utility bottleneck: DP-SGD degrades performance through noise accumulation over training steps, while aggregation-based approaches such as PATE suffer from data inefficiency due to disjoint data partitioning.

By Ding Chen, Haochen Luo, Xiaofei Wang, Chen Liu