合并值得吗?安全评估因果数据集获取的信息增益

Jake Fawkes, Lucile Ter-Minassian, Desi Ivanova, Uri Shalit, Chris Holmes
{"title":"合并值得吗?安全评估因果数据集获取的信息增益","authors":"Jake Fawkes, Lucile Ter-Minassian, Desi Ivanova, Uri Shalit, Chris Holmes","doi":"arxiv-2409.07215","DOIUrl":null,"url":null,"abstract":"Merging datasets across institutions is a lengthy and costly procedure,\nespecially when it involves private information. Data hosts may therefore want\nto prospectively gauge which datasets are most beneficial to merge with,\nwithout revealing sensitive information. For causal estimation this is\nparticularly challenging as the value of a merge will depend not only on the\nreduction in epistemic uncertainty but also the improvement in overlap. To\naddress this challenge, we introduce the first cryptographically secure\ninformation-theoretic approach for quantifying the value of a merge in the\ncontext of heterogeneous treatment effect estimation. We do this by evaluating\nthe Expected Information Gain (EIG) and utilising multi-party computation to\nensure it can be securely computed without revealing any raw data. As we\ndemonstrate, this can be used with differential privacy (DP) to ensure privacy\nrequirements whilst preserving more accurate computation than naive DP alone.\nTo the best of our knowledge, this work presents the first privacy-preserving\nmethod for dataset acquisition tailored to causal estimation. We demonstrate\nthe effectiveness and reliability of our method on a range of simulated and\nrealistic benchmarks. The code is available anonymously.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":"49 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Is merging worth it? Securely evaluating the information gain for causal dataset acquisition\",\"authors\":\"Jake Fawkes, Lucile Ter-Minassian, Desi Ivanova, Uri Shalit, Chris Holmes\",\"doi\":\"arxiv-2409.07215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Merging datasets across institutions is a lengthy and costly procedure,\\nespecially when it involves private information. Data hosts may therefore want\\nto prospectively gauge which datasets are most beneficial to merge with,\\nwithout revealing sensitive information. For causal estimation this is\\nparticularly challenging as the value of a merge will depend not only on the\\nreduction in epistemic uncertainty but also the improvement in overlap. To\\naddress this challenge, we introduce the first cryptographically secure\\ninformation-theoretic approach for quantifying the value of a merge in the\\ncontext of heterogeneous treatment effect estimation. We do this by evaluating\\nthe Expected Information Gain (EIG) and utilising multi-party computation to\\nensure it can be securely computed without revealing any raw data. As we\\ndemonstrate, this can be used with differential privacy (DP) to ensure privacy\\nrequirements whilst preserving more accurate computation than naive DP alone.\\nTo the best of our knowledge, this work presents the first privacy-preserving\\nmethod for dataset acquisition tailored to causal estimation. We demonstrate\\nthe effectiveness and reliability of our method on a range of simulated and\\nrealistic benchmarks. The code is available anonymously.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

跨机构合并数据集是一个漫长而昂贵的过程,尤其是在涉及私人信息的情况下。因此,数据主办方可能希望在不泄露敏感信息的情况下,前瞻性地评估哪些数据集最有利于合并。对于因果估计来说,这尤其具有挑战性,因为合并的价值不仅取决于认识不确定性的降低,还取决于重叠性的提高。为了应对这一挑战,我们引入了第一种加密安全信息理论方法,用于量化异质治疗效果估计中合并的价值。我们通过评估预期信息增益 (EIG),并利用多方计算来确保它可以在不泄露任何原始数据的情况下安全计算。正如我们所演示的,这可以与差分隐私(DP)一起使用,以确保隐私要求,同时保留比单纯的天真 DP 更精确的计算。我们在一系列模拟和现实基准上证明了我们方法的有效性和可靠性。代码可匿名获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Is merging worth it? Securely evaluating the information gain for causal dataset acquisition
Merging datasets across institutions is a lengthy and costly procedure, especially when it involves private information. Data hosts may therefore want to prospectively gauge which datasets are most beneficial to merge with, without revealing sensitive information. For causal estimation this is particularly challenging as the value of a merge will depend not only on the reduction in epistemic uncertainty but also the improvement in overlap. To address this challenge, we introduce the first cryptographically secure information-theoretic approach for quantifying the value of a merge in the context of heterogeneous treatment effect estimation. We do this by evaluating the Expected Information Gain (EIG) and utilising multi-party computation to ensure it can be securely computed without revealing any raw data. As we demonstrate, this can be used with differential privacy (DP) to ensure privacy requirements whilst preserving more accurate computation than naive DP alone. To the best of our knowledge, this work presents the first privacy-preserving method for dataset acquisition tailored to causal estimation. We demonstrate the effectiveness and reliability of our method on a range of simulated and realistic benchmarks. The code is available anonymously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fitting Multilevel Factor Models Cartan moving frames and the data manifolds Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks Recurrent Interpolants for Probabilistic Time Series Prediction PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1