arXiv Machine Learning

Differentially Private Range Subgraph Counting

arXiv:2606. 08179v1 Announce Type: cross Abstract: Subgraph counting is a fundamental problem in graph analysis.

arXiv Machine Learning
5d ago

Differentially-Private Decision Trees and Provable Robustness to Data Poisoning

The paper introduces PrivaTree, a differentially‑private decision tree algorithm that uses private histograms to select splits while preserving a small privacy budget. PrivaTree supports mixed numerical and categorical data without leaking information about numerical features and achieves a superior privacy‑utility trade‑off compared to existing methods. Additionally, the authors provide theoretical bounds on the expected accuracy and success rates of backdoor attacks, showing that PrivaTree-trained trees are more robust against data poisoning than standard decision trees.

By Dani\"el Vos, Jelle Vos, Tianyu Li, Zekeriya Erkin, Sicco Verwer
arXiv Machine Learning
Jul 10

EdgeRefine: Privacy-Utility Balance for Graphs via Jaccard Sampling under Edge Differential Privacy

arXiv:2607. 08659v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have shown considerable success in learning from graph-structured data, but their use in privacy-sensitive areas remains difficult because graph structure can leak sensitive link information.

By Wenxiu Ding, Muzhi Liu, Zheng Yan, Mingjun Wang, Yifan Zhao, Qiao Liu
arXiv Machine Learning
Jul 2

The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting

arXiv:2607. 00876v1 Announce Type: cross Abstract: Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each individual.

By Konstantina Bairaktari, Kasper Green Larsen
arXiv Machine Learning
Sep 23

Empirical Auditing of Edge-Private Graph Generators

The paper presents an empirical audit of privacy leakage in edge‑private graph generators by testing whether outputs from edge‑neighbouring inputs remain distinguishable. It introduces statistically valid lower bounds on privacy loss and compares direct‑edge, local‑structural, and GNN‑based attacks based on the geometry around a target edge. Experiments on two generators and two networks reveal that privacy leakage varies with both the mechanism and the network, and that learned representations expose information beyond conventional local statistics.

By Anum Fatima, Stratis Limnios, James Adams, Lukasz Szpruch, Carsten Maple, Gesine Reinert, Andrew Elliott