论文标题
使用隐私约束的最快更改检测
Quickest Change Detection with Privacy Constraint
论文作者
论文摘要
本文认为洛尔登的最小变化检测（QCD）问题具有隐私约束。目的是对信号进行消毒以满足推理隐私要求，同时能够快速检测变化。我们表明，具有正确设计的消毒通道可实现渐近最优性。我们将此卫生渠道的设计作为优化问题，但是解决方案具有挑战性。我们提出放松的优化问题，并开发算法以获得解决方案。我们还考虑了下放化框架下的隐私意识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.
