mlsanityData to 14 Oct 2026

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

arXiv 2608.13922 ↗First posted 14 Aug 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified. We introduce a representation-based approach that retains all degree-at-most-two density information while replacing density estimation by matrix mean estimation. For observations in [-1,1]d, a symmetric feature matrix H2(X)∈R(d+1)×(d+1) is constructed so that M(f)=Ef H2(X) is an isometric encoding of the degree-two orthogonal projection of the density. We scan matrix CUSUMs after rank-r truncation, exploiting the low rank of the projected jump rather than sparsity of individual coordinates. The resulting LRD estimator has a tent-shaped population objective and a nonasymptotic operator-norm analysis whose leading stochastic term scales as √rdlog(nd). For multiple changes, we give a seeded narrowest-over-threshold procedure and prove exact recovery by an induction that preserves an isolating interval for every undetected change. A cross-fitted scalar refinement learns the changing low-rank direction on one fold and localizes on the other, attaining widetilde OPp(kappa-2) error; a matching Le Cam lower bound shows optimality up to logarithms. A geometrically β-mixing extension follows from a dependent matrix Bernstein inequality. Experiments with ambient dimension up to 200, a three-change d=100 sequence, and a 128-feature human-activity benchmark show that the method remains computationally practical and accurately detects pure dependence changes that are invisible to mean CUSUMs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 17 references that are in the map. First posted on arXiv 14 Aug 2026.

Builds on

7 of 17 references.

References · 7

  1. 2016Multiple-change-point detection for high dimensional time series via sparsified binary segmentationcited by 24
  2. 2016High-dimensional changepoint estimation via sparse projectioncited by 20
  3. 2016Narrowest-Over-Threshold Detection of Multiple Change-points and Change-point-like Featurescited by 13
  4. 2019Optimal nonparametric multivariate change point detection and localizationcited by 11
  5. 2020Seeded Binary Segmentation: A general methodology for fast and optimal change point detectioncited by 11
  6. 2022Change-point Detection for Sparse and Dense Functional Data in General Dimensionscited by 3
  7. 2015Detecting and dating structural breaks in functional data without dimension reductioncited by 2

Built on by

Not cited yet.