






























Abstract:We study differential privacy (DP) in Graph Convolutional Networks (GCNs) through the framework of \textit{subsampling stability}. We derive upper bounds on the misclassification rate that depend explicitly on the subsampling probability $p_s$. Furthermore, we characterize the \textit{privacy--utility trade-off} by identifying feasible ranges of $p_s$; if $p_s$ is too large, the stability-based privacy condition becomes difficult to satisfy, yielding vacuous guarantees, whereas if it is too small, accuracy deteriorates. Our results provide the first rigorous theoretical framework for understanding subsampling stability in GCNs under DP.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.01987 [cs.LG] |
| (or arXiv:2605.01987v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.01987 arXiv-issued DOI via DataCite (pending registration) |
From: Zhongtian Ma [view email]
[v1]
Sun, 3 May 2026 17:42:11 UTC (22 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。