arXiv Machine Learning

A Privacy Study of Sparse Collaborative Inference

arXiv:2608. 16236v1 Announce Type: new Abstract: Collaborative inference (CI) splits a model between an edge device and a server, whereby the client computes an intermediate activation, transmits it, and the server completes the computation.

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
arXiv Machine Learning
Aug 20

Geometric Data Perturbation with Noisy-Anchor Alignment for Privacy-Preserving Collaborative Learning

Geometric Data Perturbation (GDP) allows participants to share distance‑preserving transformations of their private data for one‑shot collaborative learning. The paper examines the vulnerability when an analyst colludes with participants, showing that shared‑anchor alignment can restore compatibility but also enables exact data recovery. To mitigate this, the authors propose adding noise to the anchor representations rather than the private data, demonstrating through experiments on MNIST and CelebA that this approach yields better privacy‑utility trade‑offs under collusion.

By Keiyu Nosaka, Yamato Suetake, Yuichi Takano, Yukihiko Okada, Akiko Yoshise
arXiv Machine Learning
Aug 19

Picture the Epsilon: Pursuing Identity-Level Privacy Guarantees for Images

The paper compares four audit methods for assessing identity‑level differential privacy in pre‑trained, black‑box face generators. Each method—GaussMech, KDE‑LR, MMD‑TV, and ROC‑HT—has distinct assumptions, hyperparameters, and finite‑sample limitations, and they produce markedly different epsilon estimates when applied to FaceFusion and InstantID. The study finds that all methods reveal significant identity distinguishability, but none can be reliably ranked in this high‑distinguishability regime, suggesting that future work should evaluate them on partially private mechanisms.

By Arman Zareian Jahromi, Vishnu Bondalakunta, Mohammad Akbar Bin Shah, Naimul Haque, Shuangqing Wei, George T. Amariucai
arXiv Machine Learning
2d ago

From Pixels to Privacy-Sensitive Features: An Information-Theoretic Framework for Reconstruction Bounds

The paper presents an information‑theoretic framework that derives a distortion bound for reconstruction attacks on models trained with DP‑SGD. The bound can be computed before training and applies even when an adversary observes the training trajectory and knows all other training data. It separates the information leaked by training (conditional mutual information) from the inherent uncertainty in the data (source entropy) and uses rate‑distortion theory to produce a lower bound on expected reconstruction error, instantiated in both pixel and LPIPS feature spaces.

By Henry Bourne, Robert F. Allison
Hugging Face Trending Papers
Jul 8

Collaborative Synthetic Data Generation for Knowledge Transfer in Federated Learning

One-shot federated learning (OSFL) addresses the communication overhead of federated learning by limiting training to a single round, but doing so without sacrificing model quality is non-trivial, particularly when client data distributions diverge. Recent work has addressed this challenge by aggregating client knowledge on the server through the construction of transferable synthetic datasets or distillates.