Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 34 min ago
PreprintCC BY-NC-ND 4.0HAL

Detecting Support Shift in Time Series

Abstract

We consider the detection of changes in the support of distributions generating a time series. Such changes describe modifications of the region in which observations occur, and may affect its geometry or topology. We compare support descriptors computed on two adjacent windows and retain locations where the discrepancy is sufficiently large. The procedure applies to any support functional that is Lipschitz with respect to the Hausdorff distance, including geometric quantities and several persistence-based summaries. Under a lower mass condition and suitable separation and spacing assumptions, we prove recovery of the number of change points and give bounds on their localization error. We then introduce a multiscale procedure calibrated by permutation tests, which does not require knowledge of the jump sizes, segment spacings, or regularity parameters. Finally, we establish localization lower bounds for the Hausdorff distance and related functionals. These bounds recover the dependence on the jump size up to logarithmic factors and describe the loss of localization accuracy in a weak-signal regime.

Related

  1. On Detecting Multiple Simultaneous Change-points in High Dimensional Non-Stationary Time Series
    Richard Song
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Detecting a Shift Is Not Enough: Exact Minimax Limits of Linear Representation Repair
    Anuar Aimoldin, Yankai Chen, Ayana Mussabayeva +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. A convolutional framework for detecting event-driven dynamics in energy price series
    Caixia Xu, Piotr Fryzlewicz
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Auditing Conformal Prediction for Language Models Under Inference-Time Model Shift
    Achref Doula, Max Mühlhäuser
    arXivPreprintCC BY-SA 4.0Full textStatisticsarXiv
  5. Improved polynomial-time algorithms for detecting and recovering planted Θ(√n)-cliques
    Dmitriy Kunisky, Songtao Mao
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{henneuse2026detecting,
  title = {{Detecting Support Shift in Time Series}},
  author = {Hugo Henneuse},
  howpublished = {HAL},
  year = {2026},
  month = oct,
  url = {https://hal.science/hal-05801015v1},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Detecting Support Shift in Time Series
AU  - Hugo Henneuse
PY  - 2026
DA  - 2026/10/15
PB  - HAL
UR  - https://hal.science/hal-05801015v1
AB  - We consider the detection of changes in the support of distributions generating a time series. Such changes describe modifications of the region in which observations occur, and may affect its geometry or topology. We compare support descriptors computed on two adjacent windows and retain locations where the discrepancy is sufficiently large. The procedure applies to any support functional that is Lipschitz with respect to the Hausdorff distance, including geometric quantities and several persistence-based summaries. Under a lower mass condition and suitable separation and spacing assumptions, we prove recovery of the number of change points and give bounds on their localization error. We then introduce a multiscale procedure calibrated by permutation tests, which does not require knowledge of the jump sizes, segment spacings, or regularity parameters. Finally, we establish localization lower bounds for the Hausdorff distance and related functionals. These bounds recover the dependence on the jump size up to logarithmic factors and describe the loss of localization accuracy in a weak-signal regime.
ER  -