Cholette algorithm
Introduction
Given an initial time series zt,0≤t<n we have to find the corresponding xt that respects the (observed) aggregation constraints xT=∑t∈Txt and that follows the short-term movements of zt.
In the Cholette’s method, this is achieved by minimizing the following quadratic penalty function:
∑t(xt−zt|zt|λ−ρxt−1−zt−1|zt−1|λ)2It 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:
xt−zt|zt|λ=δt|zt|λ=μt μt=ρμt−1+ϵtTo simplify the notations, we will use hereafter |zt|λ=γt .
Starting from that observation, we can give the Cholette’s algorithm a state space representation.
State vector
We define the state vector as
αt=((γtμt)C_μt)Initialization
α−1=(00)Not diffuse: rho<1
P∗=(00011−ρ2)Diffuse (Denton variant): ρ=1
B=(01)
P∞=(0001)
Dynamics
Tt={(000ρ),t+1modc=0(0γt0ρ),tmodc=0(1γt0ρ),otherwise
Measurement
Zt={(0γt),tmodc=0(1γt),tmodc≠0
The “observations” are defined by Ztαt=(γtμt)C. They are available for the periods t such that t=qc−1 and missing for the other periods. For the observed periods, they correspond to xT−zT.
Once ˆμt have been estimated, we retrieve ˆxt by ˆxt=zt+γtˆμt