一种用于隐私漏斗的期望最大化松弛方法
An Expectation-Maximization Relaxed Method for Privacy Funnel
AI总结:
本文针对隐私漏斗问题提出一种基于Jensen不等式的等价松弛模型,并开发了具有理论收敛保证的闭式迭代算法,数值实验验证了其有效性。
摘要:
隐私漏斗(PF)为隐私保护数据发布提供了一个框架,其目标是在发布有用数据的同时限制相关敏感信息的暴露。由于该框架在刻画隐私-效用权衡方面具有广泛应用,它已引起人们的极大关注。因此,开发具有高精度和理论收敛保证的数值方法具有强烈的动机。在本文中,我们基于目标函数的Jensen不等式,提出了一种新的用于计算PF问题的松弛变体。该模型被证明在最优解和最优值方面与原问题等价。基于我们所提出的模型,我们开发了一种仅涉及闭式迭代的精确算法。通过下降估计和Pinsker不等式,我们算法的收敛性在理论上得到了保证。数值结果证明了所提算法的有效性。
英文摘要:
The privacy funnel (PF) gives a framework of privacy-preserving data release, where the goal is to release useful data while also limiting the exposure of associated sensitive information. This framework has garnered significant interest due to its broad applications in characterization of the privacy-utility tradeoff. Hence, there is a strong motivation to develop numerical methods with high precision and theoretical convergence guarantees. In this paper, we propose a novel relaxation variant based on Jensen's inequality of the objective function for the computation of the PF problem. This model is proved to be equivalent to the original in terms of optimal solutions and optimal values. Based on our proposed model, we develop an accurate algorithm which only involves closed-form iterations. The convergence of our algorithm is theoretically guaranteed through descent estimation and Pinsker's inequality. Numerical results demonstrate the effectiveness of our proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。