CHASM: Online Changepoint Detection in Temporal and Cross-Variable Dependence
CHASM：时间依赖与变量间依赖的在线变点检测AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
本页为预印本版本；arXiv 收录、作者填写的期刊信息以及作者既有发表经历，都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对，只展示已核实例，档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要直接研究多变量时间序列的依赖结构变化及在线变点检测。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
CHASM：时间依赖与变量间依赖的在线变点检测
- 研究问题
- 多变量时间序列的时间依赖或变量间依赖发生变化时，如何在线识别那些难以通过均值、方差等边际统计量发现的变点？
- 方法与思路
- 作者递归估计动态模态分解算子并监测截断特征值序列，以最优线性指派处理排列问题，再为复数序列构造增广监测方案。
- 材料陈述的贡献
- 摘要称，该方法在向量自回归模型下研究动力学估计的理论性质，并在模拟及实际数据中取得有竞争力或更好的检测表现。
- 阅读关注点
- 应核对特征值截断与匹配规则、增广监测统计量、报警阈值，以及有限矩条件如何支持理论结果和在线计算。
- 阅读边界
- 这是 arXiv 预印本，同行评审或接收未获核验；摘要未说明具体矩阶、误报控制和检测延迟，不能据此确认普遍优势。
原文摘要
Changepoint detection identifies times when the generative process of a time series changes, with applications in healthcare, cybersecurity, and finance. In multivariate settings, changes in cross-variable and temporal dependence are particularly challenging to detect, as they are often less pronounced than shifts in marginal statistics such as the mean or variance. Existing methods detect changes using reconstruction error, which provides only an indirect measure of dynamical change, or rely on scalar functionals that may be too coarse to capture global structure. We introduce CHASM, an online nonparametric method that monitors the truncated eigenvalue sequence of the recursively estimated dynamic mode decomposition operator. Designing such an approach raises two challenges: the permutation invariance of eigendecompositions, resolved via optimal linear assignment, and the lack of online changepoint methods for multivariate complex-valued time series, addressed through a novel augmented monitoring scheme. We study the theoretical properties of the dynamics estimator under the canonical vector autoregressive model, which directly motivates our algorithmic design. The proposed method achieves competitive or superior performance to modern competitors across synthetic and real-world data sets, including challenging settings in video and text data. It is unsupervised, depends on a small number of interpretable parameters, and requires no distributional assumptions beyond finite moments, making it readily deployable across scientific domains.