activity
20122022
most citedOptimal Change Point Detection and Localization in Sparse Dynamic Networks

34 citations · 176 across the 21 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

math.ST2021★ 5 cited

Denoising and change point localisation in piecewise-constant high-dimensional regression coefficients

Fan Wang, Oscar Hernan Madrid Padilla, Yi Yu +1

We study the theoretical properties of the fused lasso procedure originally proposed by \cite{tibshirani2005sparsity} in the context of a linear regression model in which the regre…

math.ST2021★ 1 cited

Optimal partition recovery in general graphs

Yi Yu, Oscar Hernan Madrid Padilla, Alessandro Rinaldo

We consider a graph-structured change point problem in which we observe a random vector with piecewise constant but unknown mean and whose independent, sub-Gaussian coordinates cor…

math.ST2021★ 3 cited

Lattice partition recovery with dyadic CART

Oscar Hernan Madrid Padilla, Yi Yu, Alessandro Rinaldo

We study piece-wise constant signals corrupted by additive Gaussian noise over a -dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks…

math.ST2021★ 3 cited

Locally private online change point detection

Thomas Berrett, Yi Yu

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…

stat.ME2021

Adversarially robust change point detection

Mengchu Li, Yi Yu

Change point detection is becoming increasingly popular in many application areas. On one hand, most of the theoretically-justified methods are investigated in an ideal setting wit…

math.ST2021★ 9 cited

Optimal network online change point localisation

Yi Yu, Oscar Hernan Madrid Padilla, Daren Wang +1

We study the problem of online network change point detection. In this setting, a collection of independent Bernoulli networks is collected sequentially, and the underlying distrib…