arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.08963cs.ITmath.IT
收藏

基于隐私约束的快速变化检测

Quickest Change Detection with Privacy Constraint

Tze Siong Lau, Wee Peng Tay

摘要:

本文研究了带有隐私约束的Lorden极小极大最快变化检测问题。目标是净化信号以满足推理隐私要求,同时能够快速检测变化。我们表明,广义似然比(GLR)CuSum实现渐近最优与适当设计的消毒通道。我们制定了这个消毒通道的设计作为一个优化问题,但这是具有挑战性的解决。我们提出松弛的优化问题,并开发算法来获得解决方案。我们还考虑了隐私感知QCD问题下的分散框架,并提出了算法来解决这个框架下的松弛的信道设计问题。

英文摘要:

This paper considers Lorden's minimax quickest change detection (QCD) problem with a privacy constraint. The goal is to sanitize a signal to satisfy inference privacy requirements while being able to detect a change quickly. We show that the Generalized Likelihood Ratio (GLR) CuSum achieves asymptotic optimality with a properly designed sanitization channel. We formulate the design of this sanitization channel as an optimization problem, which is however challenging to solve. We propose relaxations to the optimization problem and develop algorithms to obtain a solution. We also consider the privacy-aware QCD problem under a decentralized framework and propose algorithms to solve the relaxed channel design problem under this framework.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑