Distributional change point analysis: high dimensionality, nonstationary dependence, and computational constraints

We study general distributional change point analysis for high-dimensional time series under nonstationary temporal dependence and limited computational resources. To mitigate noise accumulation from irrelevant coordinates and reduce the computational cost, we propose a sparse random projection procedure based on characteristic functions. We quantify the computational complexity of the random projections and show that the required number of projections grows polynomially with the ambient dimension. To accommodate nonstationary temporal dependence, a Gaussian multiplier bootstrap based on contrasts of local empirical characteristic functions is developed. We establish asymptotic false detection control and simultaneous guarantees for estimating the number and locations of multiple change points, with a near-parametric uniform localization rate up to logarithmic factors. A key technical innovation is a Gaussian approximation for high-dimensional multi-scale sparse time series, which is of independent interest. Simulation studies demonstrate the effectiveness of the proposed procedure in detecting and localizing distributional changes under various temporal dependence structures. An application to neural recordings further illustrates the practical utility of the proposed method in detecting diverse distributional changes in neural activity.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22422
Primary Topic
Advanced Statistical Process Monitoring
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Distributional change point analysis: high dimensionality, nonstationary dependence, and computational constraints

Moshu Xu, Leheng Cai, Zhou Zhou
arXiv (Cornell University)
Advanced Statistical Process Monitoring
preprint

Distributional change point analysis: high dimensionality, nonstationary dependence, and computational constraints

Moshu Xu, Leheng Cai, Zhou Zhou
preprint en

Abstract

We study general distributional change point analysis for high-dimensional time series under nonstationary temporal dependence and limited computational resources. To mitigate noise accumulation from irrelevant coordinates and reduce the computational cost, we propose a sparse random projection procedure based on characteristic functions. We quantify the computational complexity of the random projections and show that the required number of projections grows polynomially with the ambient dimension. To accommodate nonstationary temporal dependence, a Gaussian multiplier bootstrap based on contrasts of local empirical characteristic functions is developed. We establish asymptotic false detection control and simultaneous guarantees for estimating the number and locations of multiple change points, with a near-parametric uniform localization rate up to logarithmic factors. A key technical innovation is a Gaussian approximation for high-dimensional multi-scale sparse time series, which is of independent interest. Simulation studies demonstrate the effectiveness of the proposed procedure in detecting and localizing distributional changes under various temporal dependence structures. An application to neural recordings further illustrates the practical utility of the proposed method in detecting diverse distributional changes in neural activity.

arXiv (Cornell University)
Advanced Statistical Process Monitoring
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon