Localising change points in piecewise polynomials of general degrees

Yi Yu, Sabyasachi Chatterjee, Haotian Xu

Research output: Contribution to journalArticlepeer-review


In this paper we are concerned with a sequence of univariate random variables with piecewise polynomial means and independent sub-Gaussian noise. The underlying polynomials are allowed to be of arbitrary but fixed degrees. All the other model parameters are allowed to vary depending on the sample size. We propose a two-step estimation procedure based on the ℓ0-penalisation and provide upper bounds on the localisation error. We complement these results by deriving global information-theoretic lower bounds, which show that our two-step estimators are nearly minimax rate-optimal. We also show that our estimator enjoys near optimally adaptive performance by attaining individual localisation errors depending on the level of smoothness at individual change points of the underlying signal. In addition, under a special smoothness constraint, we provide a minimax lower bound on the localisation errors. This lower bound is independent of the polynomial orders and is sharper than the global minimax lower bound.

Original languageEnglish (US)
Pages (from-to)1855-1890
Number of pages36
JournalElectronic Journal of Statistics
Issue number1
StatePublished - 2022


  • Piecewise polynomial
  • change point
  • minimax

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Localising change points in piecewise polynomials of general degrees'. Together they form a unique fingerprint.

Cite this