机密地揭示网络结构:提高节点私有图子估计的速率
Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation
摘要:
出于对确保社交网络隐私的日益关注,我们开发了新的算法和不可能的结果,用于将复杂的统计模型拟合到受到严格隐私保证的网络数据。我们考虑所谓的节点差分私有算法,该算法计算关于图或网络的信息,同时可证明几乎没有关于图中特定节点的存在或不存在的信息。我们提供了一个流行的和富有表现力的网络模型:随机块模型及其推广,图子的节点差分私人估计的新算法。我们的算法改进以前的工作,减少他们的错误二次和匹配,在许多制度,最佳的非私有算法。我们还表明,对于最简单的随机图模型($G(n,p)$和$G(n,m)$),节点私有算法可以在定性上比更复杂的模型更准确--收敛速度为$\frac{1}{ε^2 n^{3}}$,而不是$\frac{1}{ε^2 n^2}$。这一结果使用了一个新的扩展引理差分隐私算法,我们希望这将是广泛有用的。
英文摘要:
Motivated by growing concerns over ensuring privacy on social networks, we develop new algorithms and impossibility results for fitting complex statistical models to network data subject to rigorous privacy guarantees. We consider the so-called node-differentially private algorithms, which compute information about a graph or network while provably revealing almost no information about the presence or absence of a particular node in the graph. We provide new algorithms for node-differentially private estimation for a popular and expressive family of network models: stochastic block models and their generalization, graphons. Our algorithms improve on prior work, reducing their error quadratically and matching, in many regimes, the optimal nonprivate algorithm. We also show that for the simplest random graph models ($G(n,p)$ and $G(n,m)$), node-private algorithms can be qualitatively more accurate than for more complex models---converging at a rate of $\frac{1}{ε^2 n^{3}}$ instead of $\frac{1}{ε^2 n^2}$. This result uses a new extension lemma for differentially private algorithms that we hope will be broadly useful.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。