arXiv Machine Learning

Privacy-Robust Incrementality Measurement for Advertising Systems under Signal Loss

arXiv:2606. 03878v1 Announce Type: cross Abstract: Advertising platforms use randomized lift tests to measure incrementality, but privacy-preserving reporting systems degrade the observed signal through match-rate loss, linkability loss, attribution-window loss, aggregation-threshold suppression, randomized reporting noise, and segment-heterogeneous signal loss.

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
Aug 20

Topology-Aware Differential Privacy in Hierarchical Federated Learning

The paper introduces Fulcrum, a topology‑aware differential privacy scheme for hierarchical federated learning that allocates noise based on the size and exposure of regional aggregation groups. By deriving a closed‑form exposure dispersion metric from region structure and weights, the method optimally balances privacy and utility, achieving up to 14.84% accuracy gains on image tasks and 12.16% on text tasks at ε = 0.99 compared to uniform noise allocation. The approach ensures each participant receives noise commensurate with its actual exposure, eliminating unnecessary privacy overhead.

By Murtaza Rangwala, Richard O. Sinnott, Rajkumar Buyya
arXiv Machine Learning
6d ago

Client-Side Probing of Deleted Ridge Statistics in Federated Unlearning

The paper investigates how federated unlearning systems that broadcast updated linear classifiers after each client update can inadvertently leak the compact, additive summaries used for deletion. By submitting known changes and analyzing the returned classifiers, an attacker can recover the deleted sample’s class or even reinstate it. Experiments on MNIST and CIFAR‑10 show that high‑precision broadcasts enable exact label recovery, while lower precision limits fine‑grained recovery and diverse responses can prevent identification.

By Yijun Quan, Giovanni Montana