Change-point Detection for Sparse and Dense Functional Data in General Dimensions
Carlos Misael Madrid Padilla, Daren Wang, Zifeng Zhao, Yi Yu

TL;DR
This paper introduces FSBS, a kernel-based algorithm for change-point detection in high-dimensional functional data, capable of handling sparse or dense sampling, with proven consistency and superior performance in diverse applications.
Contribution
The paper presents the first change-point estimation method for functional data in general dimensions, with theoretical guarantees and practical efficiency.
Findings
FSBS accurately detects multiple change-points in functional data.
The method outperforms existing techniques in various simulated scenarios.
Application to sea surface temperature data demonstrates real-world utility.
Abstract
We study the problem of change-point detection and localisation for functional data sequentially observed on a general d-dimensional space, where we allow the functional curves to be either sparsely or densely sampled. Data of this form naturally arise in a wide range of applications such as biology, neuroscience, climatology, and finance. To achieve such a task, we propose a kernel-based algorithm named functional seeded binary segmentation (FSBS). FSBS is computationally efficient, can handle discretely observed functional data, and is theoretically sound for heavy-tailed and temporally-dependent observations. Moreover, FSBS works for a general d-dimensional domain, which is the first in the literature of change-point estimation for functional data. We show the consistency of FSBS for multiple change-point estimations and further provide a sharp localisation error rate, which reveals…
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.
Code & Models
Videos
Taxonomy
TopicsStatistical Methods and Inference
