DPAR:具有节点级差分隐私的解耦图神经网络
DPAR: Decoupled Graph Neural Networks with Node-Level Differential Privacy
AI总结:
本文提出DPAR,通过解耦特征投影和消息传递,利用差分隐私PageRank选择重要邻居,实现节点级差分隐私的图神经网络训练,提升隐私-效用权衡。
摘要:
图神经网络(GNNs)在处理图结构数据的学习中取得了巨大成功。然而,训练好的模型也引发了隐私担忧,这些模型可能暴露图的敏感信息,包括节点特征和结构信息。在本文中,我们旨在实现训练GNNs的节点级差分隐私(DP),以保护节点及其边。节点DP对于GNNs来说本质上是困难的,因为所有直接和多跳邻居都通过逐层消息传递参与每个节点梯度的计算,并且节点可以拥有的直接和多跳邻居数量没有界限,因此现有的DP方法会因节点高灵敏度而导致高隐私成本或较差的效用。我们提出了一种具有差分隐私近似个性化PageRank(DPAR)的解耦GNN,用于训练GNNs,并增强了隐私-效用权衡。关键思想是通过DP PageRank算法解耦特征投影和消息传递,该算法学习结构信息,并使用由PageRank确定的前$K$个邻居进行特征聚合。通过捕获每个节点最重要的邻居并避免逐层消息传递,它限制了节点灵敏度,并相比基于逐层扰动的方法实现了改进的隐私-效用权衡。我们从理论上分析了两个过程组合在一起的节点DP保证,并实证证明了在相同节点DP水平下,DPAR相比最先进的方法具有更好的效用。
英文摘要:
Graph Neural Networks (GNNs) have achieved great success in learning with graph-structured data. Privacy concerns have also been raised for the trained models which could expose the sensitive information of graphs including both node features and the structure information. In this paper, we aim to achieve node-level differential privacy (DP) for training GNNs so that a node and its edges are protected. Node DP is inherently difficult for GNNs because all direct and multi-hop neighbors participate in the calculation of gradients for each node via layer-wise message passing and there is no bound on how many direct and multi-hop neighbors a node can have, so existing DP methods will result in high privacy cost or poor utility due to high node sensitivity. We propose a Decoupled GNN with Differentially Private Approximate Personalized PageRank (DPAR) for training GNNs with an enhanced privacy-utility tradeoff. The key idea is to decouple the feature projection and message passing via a DP PageRank algorithm which learns the structure information and uses the top-$K$ neighbors determined by the PageRank for feature aggregation. By capturing the most important neighbors for each node and avoiding the layer-wise message passing, it bounds the node sensitivity and achieves improved privacy-utility tradeoff compared to layer-wise perturbation based methods. We theoretically analyze the node DP guarantee for the two processes combined together and empirically demonstrate better utilities of DPAR with the same level of node DP compared with state-of-the-art methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。