基于贝叶斯估计的gnn链路局部差分隐私

Xiaochen Zhu
{"title":"基于贝叶斯估计的gnn链路局部差分隐私","authors":"Xiaochen Zhu","doi":"10.1145/3555041.3589398","DOIUrl":null,"url":null,"abstract":"Recent years have witnessed the emergence of graph neural networks (GNNs) and an increasing amount of attention on GNNs from the data management community. Yet, training GNNs may raise privacy concerns as they may reveal sensitive information that must be kept private according to laws. In this paper, we study GNNs with link local differential privacy over decentralized nodes, where an untrusted server collaborates with node clients to train a GNN model without revealing the existence of any link. We find that by spending the privacy budget independently on links and degrees of the graph, the server can use Bayesian estimation to better denoise the graph topology. Unlike existing approaches, our mechanism does not aim to preserve graph density, but allows the server to estimate fewer links under lower privacy budget and higher uncertainty. Hence, the server makes fewer false positive link estimations and trains better models. Finally, we conduct extensive experiments to demonstrate that our method achieves considerably better performance with higher accuracy under same privacy budget compared to existing approaches.","PeriodicalId":161812,"journal":{"name":"Companion of the 2023 International Conference on Management of Data","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Link Local Differential Privacy in GNNs via Bayesian Estimation\",\"authors\":\"Xiaochen Zhu\",\"doi\":\"10.1145/3555041.3589398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent years have witnessed the emergence of graph neural networks (GNNs) and an increasing amount of attention on GNNs from the data management community. Yet, training GNNs may raise privacy concerns as they may reveal sensitive information that must be kept private according to laws. In this paper, we study GNNs with link local differential privacy over decentralized nodes, where an untrusted server collaborates with node clients to train a GNN model without revealing the existence of any link. We find that by spending the privacy budget independently on links and degrees of the graph, the server can use Bayesian estimation to better denoise the graph topology. Unlike existing approaches, our mechanism does not aim to preserve graph density, but allows the server to estimate fewer links under lower privacy budget and higher uncertainty. Hence, the server makes fewer false positive link estimations and trains better models. Finally, we conduct extensive experiments to demonstrate that our method achieves considerably better performance with higher accuracy under same privacy budget compared to existing approaches.\",\"PeriodicalId\":161812,\"journal\":{\"name\":\"Companion of the 2023 International Conference on Management of Data\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Companion of the 2023 International Conference on Management of Data\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3555041.3589398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Companion of the 2023 International Conference on Management of Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3555041.3589398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,图神经网络(gnn)的出现和数据管理界对gnn的关注越来越多。然而,训练gnn可能会泄露法律规定必须保密的敏感信息,因此可能会引发隐私问题。在本文中,我们研究了在分散节点上具有链路本地差分隐私的GNN,其中不受信任的服务器与节点客户端协作,在不透露任何链路存在的情况下训练GNN模型。我们发现,通过将隐私预算独立地花费在图的链接和度上,服务器可以使用贝叶斯估计来更好地去噪图拓扑。与现有的方法不同,我们的机制不是为了保持图密度,而是允许服务器在更低的隐私预算和更高的不确定性下估计更少的链接。因此,服务器进行更少的误报链接估计并训练更好的模型。最后,我们进行了大量的实验来证明,与现有方法相比,我们的方法在相同的隐私预算下获得了更好的性能和更高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link Local Differential Privacy in GNNs via Bayesian Estimation
Recent years have witnessed the emergence of graph neural networks (GNNs) and an increasing amount of attention on GNNs from the data management community. Yet, training GNNs may raise privacy concerns as they may reveal sensitive information that must be kept private according to laws. In this paper, we study GNNs with link local differential privacy over decentralized nodes, where an untrusted server collaborates with node clients to train a GNN model without revealing the existence of any link. We find that by spending the privacy budget independently on links and degrees of the graph, the server can use Bayesian estimation to better denoise the graph topology. Unlike existing approaches, our mechanism does not aim to preserve graph density, but allows the server to estimate fewer links under lower privacy budget and higher uncertainty. Hence, the server makes fewer false positive link estimations and trains better models. Finally, we conduct extensive experiments to demonstrate that our method achieves considerably better performance with higher accuracy under same privacy budget compared to existing approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信