Lune

NeurIPS2021Top-tier venue

Locally private online change point detection

Thomas Berrett, Yi Yu

2021Year
20Citations
3Top-tier citations

Abstract

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.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

Cited by top-tier papers3

Ask how each one uses it

Builds on2

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines