权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

CIF: Small: Foundations of Decentralized Data Science: Optimizing Utility, Privacy and Communication Efficiency

CIF：小型：去中心化数据科学的基础：优化实用性、隐私和通信效率

基本信息

批准号：
2213223
负责人：
Ayfer Ozgur
金额：
$ 60万
依托单位：
Stanford University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2022
资助国家：
美国
起止时间：
2022-07-01 至 2025-06-30
项目状态：
未结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2213223&HistoricalAwards=false
关键词：
CIF Small Foundations Decentralized Data

项目摘要

The deluge of data generated daily across mobile devices, sensors, and servers holds the promise of unprecedented inferential power to revolutionize numerous industries and scientific domains, from medicine, to engineering, to infrastructure. Traditional data science that pools this data to a single location is becoming increasingly unrealistic due to bandwidth limitations in communication networks. Legal, administrative, and ethical constraints in sharing proprietary, personal, or sensitive data pose further challenges on the path to realizing this promise. The project pursues the following query: Can one extract value from data generated across an entire network without having to collect and process it in a single location?The broad goal of this project is to harness the inferential power of distributed data without the systemic privacy risks and costs resulting from traditional data collection. The project pursues decentralized schemes for a wide range of canonical data science tasks that exchange narrowly scoped messages to complete the desired task. These messages are designed to preserve the privacy of the user data and its sensitive characteristics while minimizing the total communication cost. As a result, they provide optimal trade-offs between accuracy for the desired task, privacy for the user data, and communication efficiency. The schemes adapt to the structure of the underlying data and network and, when available, can leverage low intrinsic dimensionality of the data and multi-round interactions over the network. This project also develops information-theoretic performance benchmarks that delineate what is impossible under privacy and communication constraints and establish optimality of the proposed schemes under various criteria. As such, the project delivers a rigorous and comprehensive theoretical foundation for decentralized data science that allows many canonical tasks to be efficiently and privately implemented on distributed data.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

每天通过移动设备、传感器和服务器产生的海量数据有望带来前所未有的推理能力，从而彻底改变从医学、工程到基础设施等众多行业和科学领域。由于通信网络的带宽限制，将这些数据集中到单个位置的传统数据科学变得越来越不现实。在共享专有、个人或敏感数据方面的法律、行政和道德约束给实现这一承诺的道路带来了进一步的挑战。该项目追求以下查询：是否可以从整个网络中生成的数据中提取价值，而无需在单个位置收集和处理数据？该项目的总体目标是利用分布式数据的推理能力，同时避免传统数据收集带来的系统性隐私风险和成本。该项目为广泛的规范化数据科学任务追求分散的方案，这些任务通过交换狭窄范围的消息来完成所需的任务。这些消息旨在保护用户数据的隐私及其敏感特征，同时最大限度地降低总通信成本。因此，它们在所需任务的准确性、用户数据的隐私性和通信效率之间提供了最佳权衡。这些方案适应底层数据和网络的结构，并且在可用的情况下，可以利用数据的低固有维数和网络上的多轮交互。该项目还开发了信息论性能基准，描述了在隐私和通信约束下不可能的情况，并在各种标准下建立了所提议方案的最优性。因此，该项目为分散的数据科学提供了严格而全面的理论基础，允许在分布式数据上高效且私密地实现许多规范任务。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

期刊论文数量（5）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

The communication cost of security and privacy in federated frequency estimation

联合频率估计中的安全和隐私通信成本

DOI：
发表时间：
2023
期刊：
Proceedings of the International Workshop on Artificial Intelligence and Statistics
影响因子：
0
作者：
Wei-Ning Chen;Ayfer Ozgur;Graham Cormode;Akash Bharadwaj
通讯作者：
Akash Bharadwaj

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

信息约束最优运输：从塔拉格兰，到马顿，到 Cover