Group orthogonal greedy algorithm for change-point estimation of multivariate time series

2020 
Abstract This paper proposes a three-step method for detecting multiple structural breaks for piecewise stationary vector autoregressive processes. The number of structural breaks can be large and unknown with the locations of the breaks being different among different components. The proposed method is established via a link between a structural break problem and a high-dimensional regression problem. By means of this connection, a group orthogonal greedy algorithm, originated from the high-dimensional variable selection context, is developed for efficiently screening out potential break-points in the first step. A high-dimensional information criterion is proposed for consistent structural breaks estimation in the second step. In the third step, the information criterion further determines the specific components in which structural breaks occur. Monte Carlo experiments are conducted to demonstrate the finite sample performance, and applications to stock data are provided to illustrate the proposed method.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    25
    References
    1
    Citations
    NaN
    KQI
    []