Covariance scanning for adaptively optimal change point detection in high-dimensional linear models
Haeran Cho, Housen Li

TL;DR
This paper develops covariance scanning methods for detecting and estimating change points in high-dimensional linear models, achieving minimax optimality across sparse and dense regimes with computational efficiency.
Contribution
Introduces covariance scanning-based methods, McScan and QcScan, that are minimax optimal for change point detection in high-dimensional models, including the first to handle dense regimes.
Findings
Achieve minimax optimal detection and estimation rates.
First method to ensure consistency in dense regimes.
Computational complexity is linear in dimension and sample size.
Abstract
This paper investigates the detection and estimation of a single change in high-dimensional linear models. We derive minimax lower bounds for the detection boundary and the estimation rate, which uncover a phase transition governed by the sparsity of the covariance-weighted differential parameter. This form of "inherent sparsity" captures a delicate interplay between the covariance structure of the regressors and the change in regression coefficients on the detectability of a change point. Complementing the lower bounds, we introduce two covariance scanning-based methods, McScan and QcSan, which achieve minimax optimal performance (up to possible logarithmic factors) in the sparse and the dense regimes, respectively. In particular, QcScan is the first method shown to achieve consistency in the dense regime and further, we devise a combined procedure which is adaptively minimax optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems
