Cholette (SSF)

State space form for the Cholette algorithm

Introduction

Given an initial time series $z_t,\; 0 \le t < n$ we have to find the corresponding $x_t$ that respects the (observed) aggregation constraints $\mathbf{x_T} =\sum_{t \in T}x_t$ and that follows the short-term movements of $z_t$.

In the Cholette’s method, this is achieved by minimizing the following quadratic penalty function:

It is easy to see that the quadratic function of Cholette corresponds, from a formal point of view, to the sum of the square residuals generated by the auto-regressive process:

To simplify the notations, we will use hereafter $\vert z_t \vert^\lambda=\gamma_t$ .

Starting from that observation, we can give the Cholette’s algorithm a state space representation.

State vector

We define the state vector as

Initialization

Not diffuse: $rho<1$

Diffuse (Denton variant): $\rho=1$


Dynamics


Measurement


The “observations” are defined by $Z_t \alpha_t=\left(\gamma_t \mu_t \right)^C$. They are available for the periods $t$ such that $t=q c-1$ and missing for the other periods. For the observed periods, they correspond to $\mathbf{x_T}-\mathbf{z_T}$.

Once $\hat\mu_t$ have been estimated, we retrieve $\hat x_t$ by $\hat x_t=z_t+\gamma_t\hat\mu_t$