Change-Point Detection in Autoregressive Processes via the Cross-Entropy Method

Abstract

It is very often the case that at some moment a time series process abruptly changes its underlying structure and, therefore, it is very important to accurately detect such change-points. In this problem, which is called a change-point (or break-point) detection problem, we need to find a method that divides the original nonstationary time series into a piecewise stationary segments. In this paper, we develop a flexible method to estimate the unknown number and the locations of change-points in autoregressive time series. In order to find the optimal value of a performance function, which is based on the Minimum Description Length principle, we develop a Cross-Entropy algorithm for the combinatorial optimization problem. Our numerical experiments show that the proposed approach is very efficient in detecting multiple change-points when the underlying process has moderate to substantial variations in the mean and the autocorrelation coefficient. We also apply the proposed method to real data of daily AUD/CNY exchange rate series from 2 January 2018 to 24 March 2020.

1. Introduction

Change-point detection in time series processes, or time series segmentation, has been discussed by many authors in the fields of statistics, computer science, and data mining for several decades [1]. Change-point detection has a broad range of applications, including financial time series analysis [2,3], econometrics [4,5], and science and engineering [6,7,8]. Change-point problems are traditionally divided into two large categories: posterior (off-line) and sequential (on-line) problems; see, for example, [9]. The former is often referred to as segmentation of a signal or time series when all data are observed, while the latter assumes a stream of data coming in real-time. In this paper, we focus on the time series segmentation problem.

A change-point is defined when at least one statistical parameter in a given time series process suddenly changes, which may be caused by the variation in the mean, trend, or other internal parameters. Following the assumption of [10] and [7], a non-stationary time series process is assumed to be segmented by change-points into a sequence of piecewise stationary processes. We are interested in modeling the non-stationary autoregressive AR (p) process and estimating the unknown number of segments and the locations of change points.

Various algorithms have been proposed in time series segmentation with the aim of searching for the optimal solutions based on different types of objective (or score) functions. There are two main streams of widely used optimization methods; one is related to the Binary segmentation [11,12,13,14], and the other method is based on the dynamic programming algorithm [15,16,17]. In addition, several well-known computational approaches have been applied to change-point problems. These include the EM algorithm [18], the genetic algorithm [19,20], sequential importance sampling [21,22], MCMC algorithms [23,24,25], hybrid algorithms [26,27,28,29], and the Cross-Entropy method [8,30,31,32,33,34,35].

Many of the existing multiple change-point methods assume independence of observations. Because of this assumption, these methods tend to either underestimate or overestimate the number of change-points in autoregressive time series due to its endogenous dependent structure. For example, a stationary AR(1) process with moderate to strong autocorrelation can be confused with a change-point process with independent observations causing these segmentation methods to overestimate the number of structural breaks. References [7] and [36] took the dependence structure of autoregressive time series into account and developed a segmentation method to identify break-points using a genetic algorithm and a dynamic programming algorithm, respectively, with the objective function based on the minimum description length (MDL) information criterion. Another paper [4] implemented a strucchange algorithm designed for estimating structural changes in linear regression. Recently, [37] proposed a AR1seg approach for estimating change-points in the AR(1) model based on the assumption of a common autocorrelation coefficient for all segments. In this paper, we apply the Cross-Entropy (CE) method with the MDL principle to identify the number of and locations of change-points. In contrast to [35], we assume that observations from different segments may be generated from different AR($p_i$) processes. The statistical features, such as the order of autoregressive processes, the autocorrelation parameter, and the mean of the homogeneous segment, can be estimated if the change-points are detected, but our focus is on the detection accuracy of identifying change-points. Through extensive numerical experiments, our method shows superior detection accuracy when the underlying autocorrelation structure changes.

The paper is organized as follows. Section 2 introduces the MDL-based objective function and compares it with other popular model selection criteria, and the detailed derivation is provided. In Section 3, we describe the proposed algorithm in detail. Section 4 shows the design and results of numerical experiments. Real data analysis is shown in Section 5. Lastly, Section 6 provides a general discussion.

2. Model Selection Criteria

2.1. Change-Point Detection Problem

Firstly, let us formulate the change-point detection problem. Let $X=(X_1,X_2,\dots ,X_T)$ denote a data sequence of length T. Assume there are N unknown change-points, so X is segmented into $N+1$ segments by the set of locations $\tau =({\tau }_1,{\tau }_2,\cdots ,{\tau }_N)$, $0={\tau }_0<{\tau }_1<{\tau }_2<\cdots <{\tau }_N<{\tau }_{N+1}=T$, where the i-th segment consists of observations $(X_{{\tau }_{i-1}+1},\dots ,X_{{\tau }_i})$; i is numbered from 1 to $N+1$. Next, we assume that the data sequence X is generated by piecewise stationary AR($p_i$) processes, the model assumes that the observations within each segment are generated by a stationary AR($p_i$) process with autocorrelation coefficients ${\rho }_i=({\rho }_{i1},\cdots ,{\rho }_{i{p}_i})$, mean ${\delta }_i$, and variance ${\nu }_i^2$. The segments are assumed to be independent of each other. The parameters ${\delta }_i$, ${\nu }_i^2$, and ${\rho }_i$ are not known in advance, whereas $p_i$ is known.

$$\begin{array}{ccc}\hfill U_{t,i}& =& \sum _{j=1}^{p_i}{\rho }_{ij}{U}_{t-j,i}+{\epsilon }_{t,i},t=1,\dots ,T,i=1,\cdots ,N+1,j=1,\cdots ,p_i\hfill \\ \hfill X_{t,i}& =& {\delta }_i+U_{t,i}\hfill \end{array}$$

(1)

where the noise ${\epsilon }_{t,i}\sim \mathrm{i}.\mathrm{i}.\mathrm{d}.\mathrm{Normal}\left(0,{\nu }_i^2\right)$, $p=(p_1,p_2,\cdots ,p_{N+1})$, $\rho =({\rho }_1,{\rho }_2,\cdots ,{\rho }_{N+1})$, and the model allows for shifts in the mean, $\delta =({\delta }_1,{\delta }_2,\cdots ,{\delta }_{N+1})$; also define ${\nu }^2=({\nu }_1^2,\cdots ,{\nu }_{N+1}^2)$, $\theta =(\delta ,\rho ,p,{\nu }^2)$. It is necessary to specify the unknown parameter N, the number of change-points. Theoretically, N could be any integer between 0 and $T-1$, while in practice, we can set a maximum value for N, perhaps via the rough graphical inspection. Additionally, the change-point problem is characterized by N; if N is greater than 1, we call it multiple change-point problem; otherwise, the process is stationary. A model selection procedure is often used to determine the number of change-points; one can minimize an objective function of the form [38]:

$$\sum _{i=1}^{N+1}\left[\mathcal{C}\left(X_{({\tau }_{i-1}+1):{\tau }_i}\right)\right]+\mathcal{P}(\tau ,N,\theta )$$

(2)

where the $\mathcal{C}$ is a cost function for a segment and $\mathcal{P}$ is a penalty term. In this paper, we consider the negative log-likelihood as the cost function by rewriting (2) as a penalized likelihood information criterion:

$$-\sum _{i=1}^{N+1}\left[\mathcal{L}\left(X_{({\tau }_{i-1}+1):{\tau }_i}\right)\right]+\mathcal{P}(\tau ,N,\theta ).$$

(3)

Akaike’s information criterion (AIC), Bayesian information criterion (BIC), and modified BIC are well-known information criteria. The significant difference between these information criteria is the amount of penalty added to each parameter of the model. The penalty terms for the AIC and the BIC are given below:

$$\begin{array}{ccc}\hfill \mathrm{AIC}& :& \mathcal{P}=k,\hfill \end{array}$$

(4)

$$\begin{array}{ccc}\hfill \mathrm{BIC}& :& \mathcal{P}=\frac{1}{2}log\left(T\right)k\hfill \end{array}$$

(5)

The total number of parameters in the model is denoted by k. Thus, each parameter is penalized by the same amount. Because the AIC and BIC are not theoretically designed for the change-point problems, Zhang and Siegmund [39] proposed the modified BIC (mBIC) for determining the number of change-points in array-based comparative genomic hybridization data. The mBIC follows the classic BIC, while it differs in the penalty term. The general form that penalizes for model dimensions is given:

$$\begin{array}{ccc}\hfill \mathrm{mBIC}& :& \mathcal{P}\approx \frac{3}{2}Nlog\left(T\right)+\frac{1}{2}\sum _{i=1}^{N+1}log({\tau }_i-{\tau }_{i-1}).\hfill \end{array}$$

(6)

In addition, Lavielle [40] proposed a penalty function with an adjustable shrinkage parameter $\beta$ for the change-point problem:

$$\begin{array}{ccc}\hfill \mathrm{ShrinkageIC}& :& \mathcal{P}\approx \beta Nlog\left(T\right).\hfill \end{array}$$

(7)

In this paper, we introduce the two-stage minimum description length (MDL) for our change-point problem based on model (1); the superior flexibility is one strength of MDL. It was proposed by Rissanen (1978), based on Kolmogorov’s theory of algorithmic complexity and rooted in information theory. In developing MDL, Rissanen’s idea was to select the model with an excellent fit to the observed data while generating the least description. The term “description length” is interchangeable with “code length,” which is used to describe the complexity of each statistical model. In other words, the best model was defined by MDL as the one that can compress a vast amount of information by using less computer memory storage; the amount of computer memory is called code length, denoted by $\mathit{CL}$. Figure 1 summarizes the aforementioned penalized likelihood methods.

2.2. The Principle of Minimum Description Length

The MDL criterion can tailor penalties for parameters having different natures, while the other information criteria treat every parameter as imposing the same penalty; therefore, which parameter to be penalized and the amount to be encoded need to be formalized according to the general principles of Rissanen [41]:

• For an integer parameter N, when its value is not bounded, approximately ${log}_2\left(N\right)$ bits are encoded. If N is limited by the upper bound value $N_u$, then approximately ${log}_2\left(N_u\right)$ bits are needed.
• To encode a real parameter, if it is estimated from T observations, $\frac{1}{2}{log}_2\left(T\right)$ bits are required.

Then, we use the framework set out by [7] to derive the description length based on model (1); the MDL consists of the following four components:

• As mentioned above, the first part of two-stage MDL can be considered as a negative log-likelihood function of the whole process, by assuming that the segments are independent, and using the approximation in McLeod et al. [42] for the exact loglikelihood for the AR(p) model, the likelihood of segment i can be written as $-\frac{T}{2}log\left({\widehat{\nu }}^2\right)-\frac{1}{2}log\left({\Gamma }_s\right)$ (see [42] for further details), where ${\widehat{\nu }}^2$ is the Yule-Walker estimate, $log\left({\Gamma }_s\right)$ is the covariance determinant of first s observations.
• For the number N, the penalty term is ${log}_2\left(N\right)$. Since it can be considered as an integer parameter without being bounded, the code length is ${log}_2\left(N\right)$.
• The length for each of $N+1$ segments cannot exceed T. This means that, according to the integer parameter principle, the lengths of the segments can be encoded with ${log}_2\left(T\right)$ bits.
• $p_i$ represents the order of the AR process for each segment, which should be an integer. So the parameter can be encoded with ${log}_2\left(p_i\right)$ bits; see [7].
• For each segment i, $i=1,\cdots ,N+1$, we estimate three real-valued parameters. These are mean shift ${\delta }_i$; autocorrelation coefficient ${\rho }_{ij}$, where $j=1,\cdots ,p_i$; and variance ${\nu }_i^2$. Under the real parameter principle, each of these parameters can be computed from ${\tau }_i-{\tau }_{i-1}-1$ observations. Hence, each of them need $\frac{1}{2}{log}_2({\tau }_i-{\tau }_{i-1}-1)$ bits.

Thus, we can get the objective functions based on the MDL for the multiple change-points model:

$$\begin{array}{ccc}\hfill \mathrm{MDL}(N,\tau ,\delta ,\rho ,p,{\nu }^2)& =& -\sum _{i=1}^{N+1}log\mathcal{L}(X_{({\tau }_{i-1}+1):{\tau }_i}\mid {\widehat{\theta }}_i)+\mathcal{P}(N,\tau ,{\theta }_i)\hfill \\ & =& \underset{\mathrm{stochastic}\mathrm{complexity}\mathrm{of}\mathrm{the}\mathrm{model}}{\underbrace{-\sum _{i=1}^{N+1}\left(\frac{T}{2}log\left({\widehat{{\nu }_i}}^2\right)+\frac{1}{2}log\left({\Gamma }_{is}\right)\right)}}\hfill \\ & +& \underset{\mathrm{penalty}\mathrm{terms}}{\underbrace{logN+(N+1)logT+\sum _{i=1}^{N+1}log{p}_i+\sum _{i=1}^{N+1}\frac{p_i+2}{2}log({\tau }_i-{\tau }_{i-1}-1)}}.\hfill \end{array}$$

(8)

If there are no change-points in the model ($N=0$), the MDL for a stationary AR(p) process will be

$$\begin{array}{ccc}\hfill \mathrm{MDL}(\delta ,\rho ,p,{\nu }^2)& =& -log\mathcal{L}(X_1,X_2,\dots ,X_T\mid \widehat{\theta })+\frac{p+2}{2}logT\hfill \\ & =& -\left(\frac{T}{2}log\left({\widehat{\nu }}^2\right)+\frac{1}{2}log\left({\Gamma }_s\right)\right)+\frac{p+2}{2}logT.\hfill \end{array}$$

(9)

3. The Cross-Entropy Algorithm

In order to identify the locations of change-points in the problem—Equations (8) and (9), which can be considered a combinatorial optimization problem—we use the cross-entropy (CE) algorithm. The CE method was originally developed to estimate the rare-event probabilities as an adaptive importance sampling method, based on the Kullback–Leibler divergence (or cross-entropy) minimization [43]. The main idea of the CE method can be described by a two-step iterative procedure:

• Generate a sample from a probability distribution.
• In order to obtain a better sample, find the minimum cross-entropy distance between the sample distribution and a target distribution.

Rubinstein [44,45] then realized that the CE method can be used to solve combinatorial optimization problems. We recommend [46] for getting familiar with the principals and the applications of the CE method.

Firstly, we formulate the rare-event probability estimation problem:

$$\begin{array}{c}l\left(\alpha \right)={\mathbf{P}}_v(F\left(C\right)\le \alpha )={\mathbf{E}}_v\left[I_{\left\{F\right(C)\le \alpha \}}\right]=\sum _c{I}_{\left\{F\right(c)\le \alpha \}}f(c,v),\hfill \end{array}$$

where $F\left(C\right)$ is the objective (or score) function defined on a finite set $\mathcal{C}$, $\alpha$ is a threshold, ${\mathbf{P}}_v(F\left(C\right)\le \alpha )$ is the corresponding probability measure when C follows the probability density function (pdf) $f(·,v)$ with a real parameter v, and I is an indicator function. The main idea of the CE method is to obtain the optimal pdf from a set of pdfs $\left\{f\right(·,v\left)\right\}$ through minimizing Kullback–Leibler (or relative entropy) distance.

$$\begin{array}{ccc}\hfill v^{*}& =& \underset{v}{\mathrm{argmin}}D\{z^{*}\left(c\right),f(c,v)\}\hfill \\ & =& \underset{v}{\mathrm{argmax}}{\mathbf{E}}_u\left[I_{\left\{F\right(C)\le \alpha \}}\right]lnf(C,v)\hfill \end{array}$$

(10)

It allows us to generate a sequence $\left\{f\right(·,v\left)\right\}$ by multi-level CE implementation to get the final optimal pdf $f(·,v^{*})$. During adaptive updating procedure, a family of $\left\{({\alpha }_k,v_k)\right\}$ is generated and eventually converges to the optimal state $({\alpha }^{*},v^{*})$.

As the $F\left(C\right)$ defined as (8) or (9), our goal is to find the minimum value of $F\left(c\right)$, denoted by ${\alpha }^{*}$,

$$\begin{array}{c}\hfill {\alpha }^{*}=\underset{c\in \mathcal{C}}{min}F\left(c\right)\end{array}$$

Then, the two-step iterative procedure mentioned above can be written in the following way:

• Updating of the level parameter ${\alpha }_k$. Order the performance score increasingly, $F\left(C^{\left(1\right)}\right)\le \cdots \le F\left(C^{\left(M\right)}\right)$, $C^{\left(1\right)},\cdots ,C^{\left(M\right)}\stackrel{iid}{\sim }f(C,v_{k-1})$. Let ${\widehat{\alpha }}_k$ be the $\beta$-quantile of the ordered performance scores, which can be denoted as,

  $${\widehat{\alpha }}_k={\widehat{F}}_{(\lceil \beta M\rceil )}.$$
• Updating the reference parameter $v_k$. Given ${\alpha }_k$ and $v_{k-1}$, we can derive $v_k$ from Equation (10),

  $${\widehat{v}}_k=\underset{v_k}{\mathrm{argmax}}{\mathbf{E}}_{v_{k-1}}\left[I_{\{F\left(C\right)\le {\widehat{\alpha }}_k\}}\right]lnf(C,v_k).$$

More formally, the generic CE optimization algorithm can be described as follows (Algorithm 1).

Algorithm 1 Basic CE optimization algorithm.

1: Specify the initial parameter ${\widehat{v}}_0$ of $f(·,v)$. Let $k=1$. 2: Generate a random sample $C^{\left(1\right)},\dots ,C^{\left(M\right)}$ from $f(·,{\widehat{v}}_{k-1})$. Evaluate and order the performance score, $F_{\left(1\right)}\le \cdots \le F_{\left(M\right)}$, level parameter is estimated as ${\widehat{\alpha }}_k={\widehat{F}}_{(\lceil \beta M\rceil )}$. 3: Update the current parameter $v_k$ by solving the stochastic problem: $${\widehat{v}}_k=\underset{v_k}{\mathrm{argmax}}\frac{1}{M}\sum _{i=1}^M{I}_{\{F\left(C^{\left(i\right)}\right)\le {\widehat{\alpha }}_k\}}lnf(C^{\left(i\right)},v_k)$$ 4: Stop the process if a certain stopping criterion is met; otherwise allow $k=k+1$ and return to step 2.

The detailed information about the properties of the CE algorithm as well as its diverse applications can be found in [43] and [44]. To date, the CE method has been modified and applied to different multiple change-point problems as a combinatorial optimization algorithm in [8,30,31,32,33,34,35].

Let us now formulate the CE algorithm for the multiple change-point problem. Let $C_1,C_2,\dots ,C_N$ be a sequence representing the locations of change-points. Since the location space is finite, we can carry out the CE combinatorial optimization algorithm, and generate M rows of random samples. So here we deal with the objects $C^{\left(j\right)}=(C_1^{\left(j\right)},C_2^{\left(j\right)},\dots ,C_N^{\left(j\right)})\stackrel{iid}{\sim }f(·,v)$, $j=1,2,\cdots ,M$. The external parameters are $N_{max}$, $\beta$, and $\epsilon$; we apply the CE.AR algorithm at $1\le N\le N_{max}$. The normal distribution is served as $f(·,v)$. In practice, the users need to specify the external parameters. The main steps of our proposed CE.AR algorithm are as follows (Algorithm 2).

Algorithm 2 The CE.AR algorithm.

1: Set initial parameters of normal distribution for ${\mu }_{\left(0\right)}=\left({\mu }_{\left(0\right),1},{\mu }_{\left(0\right),2},\dots ,{\mu }_{\left(0\right),N}\right)$ and ${\left({\sigma }^2\right)}_{\left(0\right)}=\left(\left({\sigma }_{\left(0\right),1}^2\right),\left({\sigma }_{\left(0\right),2}^2\right),\dots ,\left({\sigma }_{\left(0\right),N}^2\right)\right)$. The length of both vectors is N corresponding to N change-points. Set $k=1$. 2: Generate a sequence of random samples $C^{\left(1\right)},C^{\left(2\right)},\dots ,C^{\left(M\right)}$ from the normal distributions with parameters $\left({\mu }_{(k-1)},{\left({\sigma }^2\right)}_{(k-1)}\right)$, where $C^{\left(j\right)}=\left(C_1^{\left(j\right)},C_2^{\left(j\right)},\dots ,C_N^{\left(j\right)}\right)$, for $j=1,2,\cdots ,M$, where the vector $\left(C_1,C_2,\dots ,C_N\right)$ is a vector of simulated change-points. 3: For each $j=1,2,\cdots ,M$, arrange $C_1^{\left(j\right)},C_2^{\left(j\right)},\dots ,C_N^{\left(j\right)}$ from smallest to largest and store into $c^{\left(j\right)}$. 4: Evaluate the objective function (8) for each $c^{\left(1\right)},c^{\left(2\right)},\cdots ,c^{\left(M\right)}$. Choose the elite samples $\{c^{\left(j\right)},F\left(c^{\left(j\right)}\right)\}$, where $j=1,2,\cdots ,M_{elite}$. Updating level parameter ${\widehat{\alpha }}_k$. 5: For all $i=1,2,\cdots ,N$, estimate the parameters ${\mu }_{\left(k\right),i}$ and $\left({\sigma }_{\left(k\right),i}^2\right)$ by solving the equations: $${\widehat{\mu }}_{\left(k\right),i}=\frac{{\displaystyle \sum _{j\in J}}{c}_i^{\left(j\right)}}{M_{elite}},\left({\widehat{\sigma }}_{\left(k\right),i}^2\right)=\frac{{\displaystyle \sum _{j\in J}}{\left(c_i^{\left(j\right)}-{\mu }_{\left(k\right),i}\right)}^2}{M_{elite}},$$ where J is the set of indices of the best performing samples. 6: Stopping criterion is ${max}_i\left({\sigma }_{\left(k\right),i}^2\right)<\epsilon$. 7: If the stopping criterion is met, so stop the process, then identify the combination of the positions of change-points and compare its performance score with the score of $N=0$ from (9). If ${\mathrm{MDL}}_{N\ge 1}(·)>{\mathrm{MDL}}_{N=0}(·)$, then there are no change-points. Estimate the parameters of the model for all obtained segments. If the stopping criterion is not met, set $k=k+1$ and iterate from step 2.

4. Numerical Experiments

We provide three simulated examples to illustrate the proposed CE.AR method, compared with the current methods on offer in the R packages AR1seg [37] and strucchange [47]. In the simulation study, we aim to present a detailed evaluation of the estimated number of change-points through these three methods. The CE algorithm discussed above was implemented using the breakpoint package [8] with the external settings as follows: the elite proportion value $\beta =0.05$ and the sample size $M=200$.

4.1. Example 1: Simulated AR(1) Processes with No Change-Point

The null case is considered first with three standard AR(1) processes simulated with no change-point. Three sets of 100 AR(1) sequences are generated with each sequence of length $T=201$. The autocorrelation coefficients were set to be 0.1, 0.5, and 0.9, respectively, for each set. The variance was set globally to be $\nu =1$, and the mean was set to be $\delta =0$.

Table 1. The estimated number of change-points in an AR(1) with no change points.

AR parameter	$\mathit{\rho }=0.1$			$\mathit{\rho }=0.5$			$\mathit{\rho }=0.9$
	$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$
Algorithm	$0^{*}$	1	$\ge 2$	$0^{*}$	1	$\ge 2$	$0^{*}$	1	$\ge 2$
AR1seg	95%	4%	1%	89%	3%	8%	36%	17%	47%
strucchange	97%	3%	0%	100%	0%	0%	94%	5%	1%
CE.AR	100%	0%	0%	100%	0%	0%	100%	0%	0%

shows that both strucchange and CE.AR perform well for all values of $\rho$, while AR1seg tends to slightly overestimate the number of change-points when the value autocorrelation parameter increases. The best performing method is the CE.AR method.

4.2. Example 2: Simulated AR(1) Processes with a Single Change-Point

In this example, we would like to understand how a change in either the mean or the autocorrelation coefficient affects the performances of the algorithms. To study these individual effects, we design two scenarios. In the first scenario, we assume that autocorrelation $\rho$ remains the same in a time series, while the mean jumps at each segment; the second scenario shows the opposite situation: the mean is fixed and the autocorrelation coefficient varies across segments.

4.2.1. Example 2.1

In scenario 1, we generated three sets of 100 AR(1) sequences of length 201 with a fixed autocorrelation $\rho =0.5$ and one abrupt change-point at position ${\tau }_1=100$, which partitions a time series into two segments. The mean of first segment, ${\delta }_1$, equal 0, and then jumps from 0 to ${\delta }_2=1$ or ${\delta }_2=2$ or ${\delta }_2=3$ at the second segment. For each set, three sequences of simulated piecewise AR(1) process are graphically demonstrated by Figure 2.

Table 2. The estimated number of change-points under scenario 1.

Mean Shift	${\mathit{\delta }}_2=1$			${\mathit{\delta }}_2=2$			${\mathit{\delta }}_2=3$
	$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$
Algorithm	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$
AR1seg	58%	29%	13%	20%	65%	15%	10%	68%	22%
strucchange	60%	40%	0%	2%	97%	1%	0%	97%	3%
CE.AR	97%	3%	0%	41%	58%	1%	2%	97%	1%

shows that the detection accuracies of all the methods strucchange, AR1seg, and CE.AR improved while the value of $\delta$ increased. Generally, the best performing method was the strucchange package.

We use the histogram (see Figure 3) to illustrate the performance of the estimated single change-point location under three levels of mean shifts by looking at the plot vertically to compare three methods (a,b,c) under the same settings. Overall, all methods tend to more accurately identify the change-point’s location as the mean shifts become more significant. By examining the case of ${\delta }_2=2$ or 3, we can see that AR1seg identified a few change-points located at the beginning of the process, while the CE.AR method tended to seek locations around 100. Under the case of ${\delta }_2=1$, all the methods perform poorly; the CE.AR method especially is insensitive to the small mean change.

4.2.2. Example 2.2

In scenario 2, we generated three sets of 100 AR(1) sequences of length 201 with a homogeneous mean $\delta =0$ and one abrupt change-point at position ${\tau }_1=100$ caused by the variation in autocorrelation coefficient. Three settings are displayed in

Table 3. The estimated number of change-points under scenario 2.

Coefficient Shift	${\mathit{\rho }}_1=0.1$, ${\mathit{\rho }}_2=0.5$			${\mathit{\rho }}_1=0.1$, ${\mathit{\rho }}_2=0.9$			${\mathit{\rho }}_1=0.5$, ${\mathit{\rho }}_2=0.9$
	$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$
Algorithm	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$
AR1seg	82%	6%	12%	29%	9%	62%	46%	10%	44%
strucchange	68%	32%	0%	0%	97%	3%	36%	61%	3%
CE.AR	96%	4%	0%	6%	92%	2%	90%	8%	2%

; in the first set, a weak positive correlation is followed by a moderate correlation; the change occurs from weak to strong, and from moderate to vigorous, in the second and third sets respectively. In general, the performance of strucchange is relatively better than AR1seg and CE.AR. AR1seg is not explicitly designed for this scenario since the autoregressive parameter changes between segments. It is interesting to see that CE.AR method performs very well only when $\rho$ varies dramatically. When $\rho$ does not change that much, the algorithm tends to underestimate the number of change-points, preferring a model with a smaller number of change-points.

Figure 4 displays that the estimation performance of each method under scenario 2. The strucchange shows better performance than the other two. Compared with scenario 1, when the autoregressive parameter $\rho$ varies weakly or moderately, it is more difficult for the three methods to estimate the correct number of and the locations of change-points. Lastly, the histogram shows that the estimated location of strucchange has a broader spread than CE.AR method.

In addition, we run more tests when $\rho$ changes from negative to positive; three settings are displayed in

Table 4. The estimated number of change-points under scenario 2.

Coefficient Shift	${\mathit{\rho }}_1=-0.5$, ${\mathit{\rho }}_2=0.9$			${\mathit{\rho }}_1=-0.5$, ${\mathit{\rho }}_2=0.5$			${\mathit{\rho }}_1=-0.5$, ${\mathit{\rho }}_2=0.1$
	$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$			$\widehat{\mathit{N}}$
Algorithm	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$	$0$	$1^{*}$	$\ge 2$
AR1seg	2%	0%	98%	47%	9%	44%	84%	5%	11%
strucchange	0%	97%	3%	0%	98%	2%	25%	74%	1%
CE.AR	0%	99%	1%	3%	95%	2%	87%	13%	0%

. The detection rates of strucchange and CE.AR methods increased in comparison with the previous settings.

In Example 2, we have considered two scenarios of single change-point detection. The first scenario assumes that there are no coefficient changes while the mean changes between different segments. In the second scenario, the coefficient parameter $\rho$ changes, but the mean is assumed to be 0. Individually, the coefficients are simulated to change weakly, moderately, and strongly; we have considered six cases, which are graphically illustrated in Figure 5 by plotting one time series out of the 100 simulated AR(1) sequences. The frequency charts are used to measure the performances of the three methods in terms of accuracy of estimating the location of the change-point. We found that the CE.AR method tends to concentrate on the accuracy of the change-point locations more than the other two methods, as long as the number of change-points is accurately estimated. The detection accuracies of three methods for estimating the number of change-points is summarized in Table 2, Table 3 and Table 4, which illustrate that the detection rates of all methods increase as the shift in the mean increases. From Table 4, it is evident that the CE.AR method performs better when $\rho$ changes from −0.5 to 0.5, from −0.5 to 0.9, and from 0.1 to 0.9; strucchange generally performs better than CE.AR and AR1seg. Therefore, we can conclude that the CE.AR method is not sensitive to mild coefficient changes, and it is suitable for the situations in which either there is a dramatic change in the mean or the correlation coefficient.

4.3. Example 3: AR(1) Processes with Multiple Change-Points

In this example, we consider a case of multiple change-points assuming that both the mean and the autocorrelation coefficient may change at the same time.

Firstly, we generated one set of 100 AR(1) sequences of length 201 with three change-points located at ${\tau }_1=20$, ${\tau }_2=60$, and ${\tau }_3=120$. For each segment we used the following parameters: the mean levels of ${\delta }_1=0$, ${\delta }_2=3$, ${\delta }_3=1$, and ${\delta }_4=0$; the autocorrelation coefficients of ${\rho }_1=0.1$, ${\rho }_2=0.9$, ${\rho }_3=0.9$, and ${\rho }_4=0.5$, respectively.

Table 5. Estimated number of multiple change points.

Algorithm	$\widehat{\mathit{N}}$
	0	1	2	$3^{*}$	4	$\ge 5$
AR1seg	26%	8%	25%	10%	31%	0%
strucchange	22%	68%	9%	1%	0%	0%
CE.AR	74%	13%	10%	3%	0%	0%

illustrates that none of the three methods could estimate the number of changes well enough. AR1seg performs the best under this test. A similar underestimation issue persists in the strucchange and CE.AR methods. The underestimation is less severe in the CE.AR method; strucchange shows the least accuracy in this case.

Next, we generated another set of 100 AR(1) sequences of length 201 with three change-points at ${\tau }_1=20$, ${\tau }_2=60$, and ${\tau }_3=120$. For each segment, the mean levels were ${\delta }_1=0$, ${\delta }_2=3$, ${\delta }_3=1$, and ${\delta }_4=0$, while the autocorrelation coefficients were ${\rho }_1=-0.1$, ${\rho }_2=0.9$, ${\rho }_3=-0.9$, and ${\rho }_4=0.5$.

Table 6. Estimated number of multiple change points.

Algorithm	$\widehat{\mathit{N}}$
	0	1	2	$3^{*}$	4	$\ge 5$
AR1seg	3%	1%	10%	23%	63%	0%
strucchange	0%	0%	90%	9%	1%	0%
CE.AR	0%	0%	100%	0%	0%	0%

shows that AR1seg serves as the best method for estimating the number of change-points under this setting. Both strucchange and CE.AR methods show the heavy underestimation, while the reason could be that they ignored the ${\tau }_1$. In order to evaluate the multiple segmentation performance, we introduce the Hausdorff metric, which measures the greatest distance between the estimated locations and true change-points.

$$\begin{array}{c}\hfill \mathrm{Hausdorff}(\tau ,\widehat{\tau })=\max \{\underset{{\tau }_i\in \tau }{max}\{\underset{\widehat{{\tau }_i}\in \widehat{\tau }}{min}\parallel \widehat{\tau }-{\tau }_i\parallel \},\underset{\widehat{{\tau }_i}\in \widehat{\tau }}{max}\{\underset{{\tau }_i\in \tau }{min}\parallel \widehat{\tau }-{\tau }_i\parallel \}\}.\end{array}$$

Table 7. Hausdorff distance for each algorithm and two choices of the parameters.

AR1seg	strucchange	CE.AR
73	46	39
73	30	19

shows the Hausdorff distances for each of the three methods, the first line presents the results for the first choice of the parameters, while the second line displays the distances for the second choice mentioned above.

Figure 6 shows the frequency of estimated locations for each method under the Table 6 scenario with at least one change-point detected. The AR1seg method tends to estimate the first change-point location accurately. The CE.AR1 method has 100% power to identify the second and third locations; strucchange is less capable of detecting the first change-point at ${\tau }_1=20$, while it performs well at ${\tau }_2=60$ and ${\tau }_3=120$. It is noted that all the estimations obtained from CE.AR method cluster around 60 and 120 and tend to ignore the earliest location.

5. Discussion

In this section, we aim to recapitulate the discussion of the results of the numerical experiments. We will also apply the proposed method to real data analysis.

5.1. Simulation Results

The objective of the simulation study was to evaluate the performance of the three change-point detection methods (AR1seg and strucchange and the proposed CE.AR) under various scenarios looking at two aspects of the methods’ detection accuracies: the number of estimated change-points and their locations. We use tables to summarize the estimated number of change-points, while histograms are used to measure the detection accuracy in change-point locations. The simulation study consists of three examples. In the first example, there is no change-point in the AR(1) process; the CE.AR method achieves 100% exact detection rate under each of the three choices of the autocorrelation coefficient, 0.1, 0.5, and 0.9. The second example includes two scenarios, in which we study how a change in either the mean or the autocorrelation coefficient affects the performances of the algorithms. In scenario 1, it can be seen that the detection accuracy of the CE.AR method significantly improves as the shift in the mean increases from 1 to 3. In scenario 2, the autocorrelation coefficients differ between adjacent segments; we have considered six cases, whose profiles are shown in Figure 5. The cases with weak changes in the autocorrelation coefficient, such as ${\rho }_1=-0.5$, ${\rho }_2=0.1$; ${\rho }_1=0.5$, ${\rho }_2=0.9$; or ${\rho }_1=0.1$, ${\rho }_2=0.5$, remain a challenge for the CE.AR method; it showed a heavy under-segmentation. In the third example, we consider a combined effect of the mean shift and the autocorrelation coefficient variation on piecewise AR(1) with multiple change-points. The two scenarios in this example show that the CE.AR method tends to disregard the first small segment, even if the mean or the autocorrelation coefficient changes dramatically. The histograms and Hausdorff distance show a low variation in estimated locations of change-points for the CE.AR method.

5.2. Application

We use a new real data set to demonstrate the practical aspects of our algorithm. The data were downloaded from the Reserve Bank of Australia—the daily AUD/CNY exchange rate from 2nd January 2018 to 24th March 2020. Both ARIMA and AR models have been used in the literature to model different exchange rates [48,49,50]. If an ARIMA process is used to model an exchange rate, then a change-point is recorded as a change in either the coefficients of AR part, or the MA part, or both of them. Dealing with the parameter change in the MA part of ARIMA process will be a matter of our future research. Before applying the CE.AR method, the stationary test and pre-examination are needed; the first difference of AUD/CNY is non-stationary, and we can get the rough profile of this series by using auto.arima() function which is built in forecast package [51]. If there is no obvious change in autocorrelation coefficient but in the mean level, AR1seg or the similar methods are preferred.

Figure 7 shows the estimation results obtained by the CE.AR and strucchange method. Since the actual number and the locations of change-points can not be identified in advance, we need to take both methods into account and seek for the agreement between them. The CE.AR method yields four possible change-points in 4 December 2018, 4 March 2019, 2 January 2020, and 9 September 2020, while strucchange” method presents three change-points that occurred in 3 May 2018, 28 February 2018, and 6 May 2019. Both methods have correctly identified the period from December of 2018 to May of 2019, and it seems that a regime started around 4 March 2019. According to the CE.AR method, the new regime started on 9 March 2020, so it managed to identify a very volatile period related to the COVID-19 pandemic.

If we bring the views from data itself to the real world, the cause of the changes may be the fallout from the China–United States trade war since 2018 or the uncertain climate in the Eurozone. The external shock has an impact on the Australian market, which has been reflected by the data and the estimated change points.

Hence, we suggest that the CE.AR algorithm would be a good tool for analyzing the daily AUD/CNY exchange rate; combined with the strucchange method, it will reveal more historical information. Forecasting the exchange rate based on the recent change-points will be done in the future research.

6. Conclusions

In this paper, we have proposed a new change-point detection algorithm, named CE.AR. The algorithm is able to detect change-points in piecewise AR(p) sequences, allowing variations in all parameters of the model. Our method involves two steps. Firstly, we build the MDL-based objective function to estimate the correct number of AR(p) segments. Then, we apply the Cross-Entropy algorithm for solving the combinatorial optimization problem. The numerical results show that, when the mean and the autoregression coefficient change moderately or strongly, the CE.AR method is very efficient at estimating multiple change-points. The Cross-Entropy algorithm also shows superior performance in detecting the locations of change-points. These two features make the proposed algorithm very useful from a practical point of view. We have demonstrated its usefulness by applying it to the latest real data set on the AUD/CNY exchange rate. The model considered here assumes an AR process; generalization to an ARIMA model is a matter for our further research. A limitation of the method comes from the under-segmentation when there is a small change in the mean or the autocorrelation coefficient. The improvement of detection accuracy for this problem needs to be taken into consideration in future research. In addition, it may be worth examining the impact of the lengths of the segments on the performance of the algorithm. Lastly, the question of whether our method would be helpful to improve the forecast’s accuracy is also a topic for our future research.