Lune

NeurIPS2021顶会

Locally private online change point detection

Thomas Berrett, Yi Yu

2021年份
20被引次数
3顶会引用

摘要

We study online change point detection problems under the constraint of local differential privacy (LDP) where, in particular, the statistician does not have access to the raw data. As a concrete problem, we study a multivariate nonparametric regression problem. At each time point tt, the raw data are assumed to be of the form (Xt,Yt)(X_t, Y_t), where XtX_t is a dd-dimensional feature vector and YtY_t is a response variable. Our primary aim is to detect changes in the regression function mt(x)=E(Yt∣Xt=x)m_t(x)=\mathbb{E}(Y_t |X_t=x) as soon as the change occurs. We provide algorithms which respect the LDP constraint, which control the false alarm probability, and which detect changes with a minimal (minimax rate-optimal) delay. To quantify the cost of privacy, we also present the optimal rate in the benchmark, non-private setting. These non-private results are also new to the literature and thus are interesting per se. In addition, we study the univariate mean online change point detection problem, under privacy constraints. This serves as the blueprint of studying more complicated private change point detection problems.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

引用它的顶会 Paper3

问问它们各自怎么用它

它引用的顶会 Paper2

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖