具有演化谱的时间序列变点分析
Change-Point Analysis of Time Series with Evolutionary Spectra
AI总结:
本文针对局部平稳时间序列的演化谱,提出基于wild序贯自顶向下算法的变点估计与极小极大最优检验方法,确定可区分边界的最优速率并证明估计一致性。
摘要:
本文为局部平稳时间序列的谱发展了变点方法。我们关注具有有界谱密度的序列,该谱密度在原假设下平滑变化,但在备择假设下出现变点或变得不那么平滑。我们处理两个局部问题。第一个是在未知日期和频率处检测谱中的不连续(或断裂)。第二个涉及谱在未知频率处的短时间段内发生突然但连续的变化,而不表示断裂。这两个问题都可以归结为谱密度随时间平滑程度的变化。我们考虑估计和极小极大最优检验。我们确定了极小极大可区分边界的最优速率,即能够一致控制第一类和第二类错误的最小断裂幅度。我们提出了一种基于wild序贯自顶向下算法的新颖变点估计程序,并证明了在收缩位移和可能增长的变点数量下其一致性。我们的方法可用于许多领域,并在流行的软件包中提供了配套程序。
英文摘要:
This paper develops change-point methods for the spectrum of a locally stationary time series. We focus on series with a bounded spectral density that change smoothly under the null hypothesis but exhibits change-points or becomes less smooth under the alternative. We address two local problems. The first is the detection of discontinuities (or breaks) in the spectrum at unknown dates and frequencies. The second involves abrupt yet continuous changes in the spectrum over a short time period at an unknown frequency without signifying a break. Both problems can be cast into changes in the degree of smoothness of the spectral density over time. We consider estimation and minimax-optimal testing. We determine the optimal rate for the minimax distinguishable boundary, i.e., the minimum break magnitude such that we are able to uniformly control type I and type II errors. We propose a novel procedure for the estimation of the change-points based on a wild sequential top-down algorithm and show its consistency under shrinking shifts and possibly growing number of change-points. Our method can be used across many fields and a companion program is made available in popular software packages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。