Misplaced Pages

This is an old revision of this page, as edited by Lilianmm87 (talk | contribs) at 14:58, 28 February 2023 (→Software). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This article, Innovation method, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary. Reviewer tools: Inform author

In statistics, the Innovation Method provides an estimator for the parameters of stochastic differential equations given a time series of (potentially noisy) observations of the state variables. In the framework of continuous-discrete state space models, the innovation estimator is obtained by maximizing the log-likelihood of the corresponding discrete-time innovation process with respect to the parameters. The innovation estimator can be classified as a M-estimator, a quasi-maximum likelihood estimator or a prediction error estimator depending of the inferential considerations that want to be emphasized. The innovation method is a system identification technique for developing mathematical models of dynamical systems from measured data and for the optimal design of experiments.

Background

Stochastic differential equations (SDEs) have became an important mathematical tool for describing the time evolution of several random phenomenon in natural, social and applied sciences. Statistical inference for SDEs is thus of great importance in applications for model building, model selection, model identification and forecasting. To carry out statistical inference for SDEs, measurements of the state variables of these random phenomena are indispensable. Usually, in practice, only a few state variables are measured by physical devices that introduce random measurement errors (observational errors).

Mathematical model for inference

The innovation estimator for SDEs is defined in the framework of continuous-discrete state space models . These models arise as natural mathematical representation of the temporal evolution of continuous random phenomena and their measurements in a succession of time instants. In the simplest formulation, these continuous-discrete models are expressed in term of a SDE of the form

${\displaystyle \qquad \qquad d\mathbf {x} (t)=\mathbf {f} (t,\mathbf {x} (t);\theta )dt+\sum _{i=1}^{m}\mathbf {g} _{i}\ (t,\mathbf {x} (t);\theta )\ d\mathbf {w} ^{i}(t)\qquad \qquad (1)}$

describing the time evolution of ${\displaystyle d}$ state variables ${\displaystyle \mathbf {x} }$ of the phenomenon for all time instant ${\displaystyle t\geq t_{0}}$, and an observation equation

${\displaystyle \qquad \qquad \mathbf {z} _{t_{k}}=\mathbf {Cx} (t_{k})+\mathbf {e} _{t_{k}}\qquad \qquad (2)}$

describing the time series of measurements ${\displaystyle \mathbf {z} _{t_{0}},...,\mathbf {z} _{t_{M-1}}}$of at least one of the variables ${\displaystyle \mathbf {x} }$ of the random phenomenon on ${\displaystyle M}$ time instants ${\displaystyle t_{0}\ ,...,\ t_{M-1}}$. In the model (1)-(2), ${\displaystyle \mathbf {f} }$ and ${\displaystyle \mathbf {g} _{i}}$ are differentiable functions, ${\displaystyle \mathbf {w} =(\mathbf {w} ^{1},...,\mathbf {w} ^{m})}$ is an ${\displaystyle m}$-dimensional standard Wiener process, ${\displaystyle \theta \in \mathbb {R} ^{p}}$ is a vector of ${\displaystyle p}$ parameters, ${\displaystyle \{\mathbf {e} _{t_{k}}:\mathbf {e} _{t_{k}}\sim \mathrm {N} (0,\Pi _{t_{k}})\}_{k=0,...,M-1}}$ is a sequence of ${\displaystyle r}$-dimensional i.i.d. Gaussian random vectors independent of ${\displaystyle \mathbf {w} }$, ${\displaystyle \Pi _{t_{k}}}$ an ${\displaystyle r\times r}$ positive definite matrix, and ${\displaystyle C}$ an ${\displaystyle r\times d}$ matrix.

Statistical problem to solve

Once the dynamics of a phenomenon is described by a state equation as (1) and the way of measurement the state variables specified by a observation equation as (2), the inference problem to solve is the following : given ${\displaystyle M}$ partial and noisy observations ${\displaystyle \mathbf {z} _{t_{0}},...,\mathbf {z} _{t_{M-1}}}$ of the stochastic process ${\displaystyle \mathbf {x} }$ on the observation times ${\displaystyle t_{0},...,t_{M-1}}$, estimate the unobserved state variable of ${\displaystyle \mathbf {x} }$ and the unknown parameters ${\displaystyle \theta }$ in (1) that better fit to the given observations.

Discrete-time innovation process

Let ${\displaystyle \{t\}_{M}}$ be the sequence of ${\displaystyle M}$ observation times ${\displaystyle t_{0},\ldots ,t_{M-1}}$ of the states of (1), and ${\displaystyle Z_{\rho }=\{\mathbf {z} _{t_{k}}:t_{k}\leq \rho ,t_{k}\in \{t\}_{M}\}}$ the time series of partial and noisy measurements of ${\displaystyle \mathbf {x} }$ described by the observation equation (2).

Further, let ${\displaystyle \mathbf {x} _{t/\rho }=\mathrm {E} (\mathbf {x} (t)|Z_{\rho })}$ and ${\displaystyle \mathbf {U} _{t/\rho }=E(\mathbf {x} (t)\mathbf {x} ^{\intercal }(t)|Z_{\rho })-\mathbf {x} _{t/\rho }\mathbf {x} _{t/\rho }^{\intercal }}$ be the conditional mean and variance of ${\displaystyle \mathbf {x} }$ with ${\displaystyle \rho \leq t}$, where ${\displaystyle E(\cdot )}$ denotes the expected value of random vectors.

The random sequence ${\displaystyle \{\nu _{t_{k}}\}_{k=1,\ldots ,M-1},}$ with

${\displaystyle \qquad \qquad \nu _{t_{k}}=\mathbf {z} _{t_{k}}-\mathbf {Cx} _{{t_{k}}/{t_{k-1}}}(\theta ),\qquad \qquad (3)}$

defines the discrete-time innovation process , where ${\displaystyle \nu _{t_{k}}}$ is proved to be an independent normally distributed random vector with zero mean and variance

${\displaystyle \qquad \qquad \Sigma _{t_{k}}=\mathbf {CU} _{{t_{k}}/t_{k-1}}(\theta )\ \mathbf {C} ^{\intercal }+\Pi _{t_{k}},\qquad \qquad (4)}$

for small enough ${\displaystyle \Delta ={\underset {k}{\max }}\{t_{k+1}-t_{k}\}}$, with ${\displaystyle t_{k},t_{k+1}\in \{t\}_{M}}$. In practice , this distribution for the discrete-time innovation is valid when, with a suitable selection of both, the number ${\displaystyle M}$ of observations and the time distance ${\displaystyle t_{k+1}-t_{k}}$ between consecutive observations, the time series of observations ${\displaystyle \mathbf {z} _{t_{0}},...,\mathbf {z} _{t_{M-1}}}$ of the SDE contains the main information about the continuous-time process ${\displaystyle \mathbf {x} }$. That is, when the sampling of the continuous-time variables has low distortion (aliasing).

Innovation estimator

The innovation estimator for the parameters of the SDE (1) is the one that maximizes the likelihood function of the discrete-time innovation process ${\displaystyle \{\nu _{t_{k}}\}_{k=1,\ldots ,M-1}}$ with respect to the parameters . More precisely, given ${\displaystyle M}$ measurements ${\displaystyle Z_{t_{M-1}}}$of the state space model (1)-(2) with ${\displaystyle \theta =\theta _{0}}$ on ${\displaystyle \{t\}_{M},}$ the innovation estimator for the parameters ${\displaystyle \theta _{0}}$ of (1) is defined by

${\displaystyle \qquad \qquad {\hat {\theta }}_{M}=\operatorname {\arg\{} {\underset {\theta }{\min }}\ U_{M}(\theta ,Z_{t_{M-1}})\},\qquad \qquad (5)}$

where

${\displaystyle \qquad \qquad U_{M}(\theta ,Z_{t_{M-1}})=(M-1)\ln(2\pi )+\sum _{k=1}^{M-1}\ln(\det(\Sigma _{t_{k}}))+\nu _{t_{k}}^{\intercal }\Sigma _{t_{k}}^{-1}\nu _{t_{k}},}$

being ${\displaystyle \nu _{t{_{k}}}}$the discrete-time innovation (3) and ${\displaystyle \Sigma _{t_{k}}}$the innovation variance (4) of the model (1)-(2) at ${\displaystyle t_{k}}$, for all ${\displaystyle k=1,...,M-1.}$ In the above expression for ${\displaystyle U_{M}(\theta ,Z_{t_{M-1}}),}$ the conditional mean ${\displaystyle \mathbf {x} _{t_{k}/t_{k-1}}(\theta )}$ and variance ${\displaystyle \mathbf {U} _{t_{k}/t_{k-1}}(\theta )}$ are computed by the continuous-discrete filtering algorithm for the evolution of the moments (Section 6.4 in ), for all ${\displaystyle k=1,...,M-1.}$

Differences with the maximum likelihood estimator

The maximum likelihood estimator of the parameters ${\displaystyle \theta }$ in the model (1)-(2) involves the evaluation of the - usually unknown - transition density function ${\displaystyle p_{\theta }(t_{k+1}-t_{k},\mathbf {x} (t_{k}),\mathbf {x} (t_{k+1}))}$ between the states ${\displaystyle \mathbf {x} (t_{k})}$ and ${\displaystyle \mathbf {x} (t_{k+1})}$ of the diffusion process ${\displaystyle \mathbf {x} }$ for all the observation times ${\displaystyle t_{k}}$ and ${\displaystyle t_{k+1}}$ . instead of this, the innovation estimator (5) is obtained by maximizing the likelihood of the discrete-time innovation process ${\displaystyle \{\nu _{t_{k}}\}_{k=1,...,M-1},}$ taking into account that ${\displaystyle \nu _{t_{0}},...,\nu _{t_{M-1}}}$ are Gaussian and independent random vectors. Remarkably, whereas the transition density function ${\displaystyle p_{\theta }(t_{k+1}-t_{k},\mathbf {x} (t_{k}),\mathbf {x} (t_{k+1}))}$ changes when the SDE for ${\displaystyle \mathbf {x} }$ does, the transition density function ${\displaystyle {\mathfrak {p}}_{\theta }(t_{k+1}-t_{k},\nu _{t_{k}},\nu _{t_{k+1}})}$ for the innovation process remains Gaussian independently of the SDEs for ${\displaystyle \mathbf {x} }$. Only in the case that the diffusion ${\displaystyle \mathbf {x} }$ is described by a linear SDE with additive noise, the density function ${\displaystyle p_{\theta }(t_{k+1}-t_{k},\mathbf {x} (t_{k}),\mathbf {x} (t_{k+1}))}$ is Gaussian and equal to ${\displaystyle {\mathfrak {p}}_{\theta }(t_{k+1}-t_{k},\nu _{t_{k}},\nu _{t_{k+1}}),}$ and so the maximum likelihood and the innovation estimator coincide . Otherwise , the innovation estimator is an approximation to the maximum likelihood estimator and, in this sense, the innovation estimator is a Quasi-Maximum Likelihood estimator. In addition, the innovation method is a particular instance of the Prediction Error method according to the definition given in . Therefore, the asymptotic results obtained in for that general class of estimators are valid for the innovation estimators . Intuitively, by following the typical control engineering viewpoint, it is expected that the innovation process - viewed as a measure of the prediction errors of the fitted model - be approximately a white noise process when the models fit the data , which can be used as a practical tool for designing of models and for optimal experimental design .

Properties

The innovation estimator (5) has a number of important attributes:

• Under conventional regularity conditions, the innovation estimator (5) is consistent and asymptoticaly normal distributed .

• For selecting models, the maximum log-likelihood ${\displaystyle -U_{M,h}({\widehat {\theta }}_{M},Z_{t_{M-1}})}$ of the innovation estimator (5) can be used to compute the Akaike or Bayesian information criterion.

• The ${\displaystyle 100(1-\alpha )\%}$ confidence limits ${\displaystyle {\widehat {\theta }}_{M}\pm \bigtriangleup }$ for the innovation estimator ${\displaystyle {\widehat {\theta }}_{M}}$ is estimated with

${\displaystyle \ \qquad \qquad \bigtriangleup =t_{1-\alpha ,M-\rho -1}{\sqrt {\frac {diag(Var({\widehat {\theta }}_{M}))}{M-p}}},}$

where ${\displaystyle t_{1-\alpha ,M-p-1}}$ is the t-student distribution with ${\displaystyle 100(1-\alpha )\%}$ significance level, and ${\displaystyle M-p-1}$ degrees of freedom . Here, ${\displaystyle {\text{V}}ar({\widehat {\theta }}_{M})=(I({\widehat {\theta }}_{M}))^{-1}}$ denotes the variance of the innovation estimator ${\displaystyle {\widehat {\theta }}_{M}}$, where

${\displaystyle \ \qquad \qquad I({\widehat {\theta }}_{M})=\sum _{k=1}^{M-1}I_{k}({\widehat {\theta }}_{M})}$

is the Fisher Information matrix the innovation estimator ${\displaystyle {\widehat {\theta }}_{M}}$ of ${\displaystyle \theta _{0}}$ and

${\displaystyle \qquad \qquad \lbrack I_{k}({\widehat {\theta }}_{M})]_{m,n}={\frac {\partial \mu ^{\intercal }}{\partial \theta _{m}}}\Sigma ^{-1}{\frac {\partial \mu }{\partial \theta _{n}}}+{\frac {1}{2}}trace(\Sigma ^{-1}{\frac {\partial \Sigma }{\partial \theta _{m}}}\Sigma ^{-1}{\frac {\partial \Sigma }{\partial \theta _{n}}})}$

is the entry ${\displaystyle (m,n)}$ of the matrix ${\displaystyle I_{k}({\widehat {\theta }}_{M})}$ with ${\displaystyle \mu =\mathbf {Cx} _{t_{k}/t_{k-1}}({\widehat {\theta }}_{M})}$ and ${\displaystyle \Sigma =\mathbf {\Sigma } _{t_{k}}({\widehat {\theta }}_{M})}$, for ${\displaystyle 1\leq m,n\leq p}$.

• The distribution of the fitting-innovation process ${\displaystyle \{\mathbf {\nu } _{t_{k}}:\mathbf {\nu } _{t_{k}}=\mathbf {z} _{t_{k}}-\mathbf {Cx} _{t_{k}/t_{k-1}}({\widehat {\theta }}_{M})\}_{k=1,\ldots M-1}}$ measures the goodness of fit of the model to the data .

• For smooth enough function ${\displaystyle \mathbf {h} }$, nonlinear observation equations of the form

${\displaystyle \qquad \qquad \mathbf {z} _{t_{k}}=\mathbf {h} (t_{k}{\text{, }}\mathbf {x} (t_{k}))+\mathbf {e} _{t_{k}},\qquad \qquad (6)}$

can be transformed to the simpler one (2), and the innovation estimator (5) can be applied .

Approximate Innovation estimators

In practice, close form expressions for computing ${\displaystyle \mathbf {x} _{t_{k}/t_{k-1}}(\theta )}$ and ${\displaystyle \mathbf {U} _{t_{k}/t_{k-1}}(\theta )}$ in (5) are only available for a few models (1)-(2). Therefore, approximate filtering algorithms as the following are used in applications.

Given ${\displaystyle M}$ measurements ${\displaystyle Z_{t_{M-1}}}$ and the initial filter estimates ${\displaystyle \mathbf {y} _{t_{0}/t_{0}}=\mathbf {x} _{t_{0}/t_{0}}}$, ${\displaystyle \mathbf {V} _{t_{0}/t_{0}}=\mathbf {U} _{t_{0}/t_{0}}}$, the approximate Linear Minimum Variance (LMV) filter for the model (1)-(2) is iteratively defined at each observation time ${\displaystyle t_{k}\in \{t\}_{M}}$ by the prediction estimates

${\displaystyle \qquad \qquad \mathbf {y} _{t_{k+1}/t_{k}}=E(\mathbf {y} (t_{k+1})|Z_{t_{k}})\quad }$ and ${\displaystyle \quad \mathbf {V} _{t_{k+1}/t_{k}}=E(\mathbf {y} (t_{k+1})\mathbf {y} ^{\intercal }(t_{k+1})|Z_{t_{k}})-\mathbf {y} _{t_{k+1}/t_{k}}\mathbf {y} _{t_{k+1}/t_{k}}^{\intercal },\qquad (7)}$

with initial conditions ${\displaystyle \mathbf {y} _{t_{k}/t_{k}}}$ and ${\displaystyle \mathbf {V} _{t_{k}/t_{k}}}$, and the filter estimates

${\displaystyle \qquad \qquad \mathbf {y} _{t_{k+1}/t_{k+1}}=\mathbf {y} _{t_{k+1}/t_{k}}+\mathbf {K} _{t_{k+1}}\mathbf {(\mathbf {z} } _{t_{k+1}}-\mathbf {\mathbf {C} y} _{t_{k+1}/t_{k}}\mathbf {)} \quad }$ and ${\displaystyle \quad \mathbf {V} _{t_{k+1}/t_{k+1}}=\mathbf {V} _{t_{k+1}/t_{k}}-\mathbf {K} _{t_{k+1}}\mathbf {CV} _{t_{k+1}/t_{k}}\qquad (8)}$

with filter gain

${\displaystyle \qquad \qquad \mathbf {K} _{t_{k+1}}=\mathbf {V} _{t_{k+1}/t_{k}}\mathbf {C} ^{\intercal }\mathbf {CV} _{t_{k+1}/t_{k}}(\mathbf {C} ^{\intercal }+\mathbf {\Pi } _{t_{k+1}})^{-1}}$

for all ${\displaystyle t_{k},t_{k+1}\in \{t\}_{M}}$, where ${\displaystyle \mathbf {y} }$ is an approximation to the solution ${\displaystyle \mathbf {x} }$ of (1) on the observation times ${\displaystyle {t}_{M}}$.

Given ${\displaystyle M}$ measurements ${\displaystyle Z_{t_{M-1}}}$ of the state space model (1)-(2) with ${\displaystyle \mathbf {\theta =\theta } _{0}}$ on ${\displaystyle \{t\}_{M}}$, the approximate innovation estimator for the parameters ${\displaystyle \mathbf {\theta } _{0}}$ of (1) is defined by

${\displaystyle \qquad \qquad {\widehat {\mathbf {\vartheta } }}_{M}=\arg\{{\underset {\mathbf {\theta \in } {\mathcal {D}}_{\theta }}{\mathbf {\min } }}{\text{ }}{\widetilde {U}}_{M}\mathbf {(\theta } ,Z_{t_{M-1}})\},\qquad \qquad (9)}$

where

${\displaystyle \qquad \qquad {\widetilde {U}}_{M}(\mathbf {\theta } ,Z_{t_{M-1}})=(M-1)\ln(2\pi )+\sum \limits _{k=1}^{M-1}\ln(\det({\widetilde {\mathbf {\Sigma } }}_{t_{k}}))+{\widetilde {\mathbf {\nu } }}_{t_{k}}^{\intercal }({\widetilde {\mathbf {\Sigma } }}_{t_{k}})^{-1}{\widetilde {\mathbf {\nu } }}_{t_{k}},}$

being

${\displaystyle \qquad \qquad {\widetilde {\mathbf {\nu } }}_{t_{k}}=\mathbf {z} _{t_{k}}-\mathbf {Cy} _{t_{k}/t_{k-1}}(\theta )\qquad }$ and ${\displaystyle \qquad {\widetilde {\mathbf {\Sigma } }}_{t_{k}}=\mathbf {CV} _{t_{k}/t_{k-1}}(\theta )\mathbf {C} ^{\intercal }+\mathbf {\Pi } _{t_{k}}}$

approximations to the discrete-time innovation (3) and innovation variance (4), respectively, resulting from the filtering algorithm (7)-(8).

For models with complete observations free of noise (i.e, with ${\displaystyle \mathbf {C} =\mathbf {I} }$ and ${\displaystyle \mathbf {\Pi } _{t_{k}}=0}$ in (2), the approximate innovation estimator (9) reduces to the known Quasi-Maximum Likelihood estimators for SDEs .

Main conventional-type estimators

Conventional-type innovation estimators are those (9) derived from conventional-type continuous-discrete or discrete-discrete approximate filtering algorithms. With approximate continuous-discrete filters there are the innovation estimators based on Local Linearization (LL) filters , on the extended Kalman filter , and on the second order filters . Approximate innovation estimators based on discrete-discrete filters result from the discretization of the SDE (1) by means of a numerical scheme . Typically, the effectiveness of these innovation estimators is directly related to the stability of the involved filtering algorithms.

A shared drawback of these approximate innovation estimators is that, once the observations are given, the error between the approximate and the exact innovation process is fixed and completely settled by the time distance between observations . This might sets a large bias of the approximate estimators in some applications, bias that can not be corrected by increasing the number of observations. However, they are useful in many practical situations for which only medium or low accuracy for the parameter estimation is required .

Order-β innovation estimators

Let us consider the finer time discretization ${\displaystyle \left(\tau \right)_{h>0}=\{\tau _{n}:\tau _{n+1}-\tau _{n}\leq h{\text{ for }}n=0,1,\ldots ,N\}}$ of the time interval ${\displaystyle }$ satisfying the condition ${\displaystyle \left(\tau \right)_{h}\supset \{t\}_{M}}$. Further, let ${\displaystyle \mathbf {y} }$ be an approximation to ${\displaystyle \mathbf {x} }$ defined on the time discretization ${\displaystyle \left(\tau \right)_{h}\supset \{t\}_{M}}$, and ${\displaystyle \mathbf {y} _{t_{k}/t_{k-1}}=E(\mathbf {y(} t)|Z_{t_{k}})}$ and ${\displaystyle \mathbf {V} _{t_{k}/t_{k-1}}=E(\mathbf {y(} t)\mathbf {y} ^{\intercal }(t)|Z_{t_{k}})-\mathbf {y} _{t_{k+1}/t_{k}}\mathbf {y} _{t_{k+1}/t_{k}}^{\intercal }}$ approximations to the exact conditional mean ${\displaystyle \mathbf {x} _{t_{k}/t_{k-1}}}$ and variance ${\displaystyle \mathbf {U} _{t_{k}/t_{k-1}}}$ for all ${\displaystyle t_{k},t_{k-1}\in \{t\}_{M}}$.

A order-${\displaystyle \beta }$ LMV filter is an approximate LMV filter for which ${\displaystyle \mathbf {y} }$ is an order-${\displaystyle \beta }$ weak approximation to ${\displaystyle \mathbf {x} }$ satisfying the weak convergence condition

${\displaystyle \qquad \qquad {\underset {t_{k}\leq t\leq t_{k+1}}{\sup }}\left\vert E\left(g(\mathbf {x} (t))|Z_{t_{k}}\right)-E\left(g(\mathbf {y} (t))|Z_{t_{k}}\right)\right\vert \leq L_{k}h^{\beta }}$

for all ${\displaystyle t_{k},t_{k+1}\in \{t\}_{M}}$ and any ${\displaystyle 2(\beta +1)}$ times continuously differentiable functions ${\displaystyle g:\mathbb {R} ^{d}\rightarrow \mathbb {R} }$ for which ${\displaystyle g}$ and all its partial derivatives up to order ${\displaystyle 2(\beta +1)}$ have polynomial growth, being ${\displaystyle L_{k}}$ a positive constant. This order-${\displaystyle \beta }$ LMV filter converges with rate ${\displaystyle \beta }$ to the exact LMV filter as ${\displaystyle h}$ goes to zero , where ${\displaystyle h}$ is the maximum stepsize of the time discretization ${\displaystyle (\tau )_{h}\supset \{t\}_{M}}$ on which the approximation ${\displaystyle \mathbf {y} }$ to ${\displaystyle \mathbf {x} }$ is defined.

A order-${\displaystyle \beta }$ innovation estimator is an approximate innovation estimator (9) for which the approximations to the discrete-time innovation (3) and innovation variance (4), respectively, resulting from an order-${\displaystyle \beta }$ LMV filter.

Approximations ${\displaystyle \mathbf {y} }$ of any kind converging to ${\displaystyle \mathbf {x} }$ in a weak sense (as, e.g., those in ) can be used to design an order-${\displaystyle \beta }$ LMV filter and, consequently, an order-${\displaystyle \beta }$ innovation estimator. These order-${\displaystyle \beta }$ innovation estimators are intended for the recurrent practical situation in which a diffusion process should be identified from a reduced number of observations distant in time or when high accuracy for the estimated parameters is required.

Properties

An order-${\displaystyle \beta }$ innovation estimator ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$ has a number of important properties :

• For each given data ${\displaystyle Z_{t_{M-1}}}$ of ${\displaystyle M}$ observations, ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$ converges to the exact innovation estimator ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}}$ as the maximum stepsize ${\displaystyle h}$ of the time discretization ${\displaystyle \left(\tau \right)_{h}\supset \{t\}_{M}}$ goes to zero.

• For finite samples of ${\displaystyle M}$ observations, the expected value of ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$ converges to the expected value of the exact innovation estimator ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}}$ as ${\displaystyle h}$ goes to zero.

• For an increasing number of observations, ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$ is asymptotically normal distributed and its bias decreases when ${\displaystyle h}$ goes to zero.

• Likewise for the convergence of the order-${\displaystyle \beta }$ LMV filter to the exact LMV filter, for the convergence and asymptotic properties of ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$ there are no constraints on the time distance ${\displaystyle t_{k+1}-t_{k}}$ between two consecutive observations ${\displaystyle \mathbf {z} _{t_{k}}}$ and ${\displaystyle \mathbf {z} _{t_{k+1}}}$, nor on the time discretization ${\displaystyle (\tau )_{h}\supset \{t\}_{M}}$.

• Approximations for the Akaike or Bayesian information criterion and confidence limits are directly obtained by replacing the exact estimator ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}}$ by its approximation ${\displaystyle {\widehat {\mathbf {\theta } }}_{M}(h)}$. These approximations converge to the corresponding exact one when the maximum stepsize ${\displaystyle h}$ of the time discretization ${\displaystyle \left(\tau \right)_{h}\supset \{t\}_{M}}$ goes to zero.

• The distribution of the approximate fitting-innovation process ${\displaystyle \{\mathbf {\nu } _{t_{k}}:\mathbf {\nu } _{t_{k}}=\mathbf {z} _{t_{k}}-\mathbf {Cy} _{t_{k}/t_{k-1}}({\widehat {\theta }}_{M}(h))\}_{k=1,\ldots M-1}}$ measures the goodness of fit of the model to the data, which is also used as a practical tool for designing of models and for optimal experimental design.

• For smooth enough function ${\displaystyle \mathbf {h} }$, nonlinear observation equations of the form (6) can be transformed to the simpler one (2), and the order-${\displaystyle \beta }$ innovation estimator can be applied.

Figure 1 presents the histograms of the differences ${\displaystyle ({\widehat {\alpha }}_{M}-{\widehat {\alpha }}_{h,M}^{D},{\widehat {\sigma }}_{M}-{\widehat {\sigma }}_{h,M}^{D})}$ and ${\displaystyle ({\widehat {\alpha }}_{M}-{\widehat {\alpha }}_{h,M},{\widehat {\sigma }}_{M}-{\widehat {\sigma }}_{h,M})}$ between the exact innovation estimator ${\displaystyle ({\widehat {\alpha }}_{M},{\widehat {\sigma }}_{M})}$ with the conventional ${\displaystyle ({\widehat {\alpha }}_{h,M}^{D},{\widehat {\sigma }}_{h,M}^{D})}$ and order-${\displaystyle 1}$ ${\displaystyle ({\widehat {\alpha }}_{h,M},{\widehat {\sigma }}_{h,M})}$ innovation estimators for the parameters ${\displaystyle \alpha =-0.1}$ and ${\displaystyle \sigma =0.1}$ of the equation

${\displaystyle \qquad dx=txdt+\sigma {\sqrt {t}}xdw\quad (10)}$

obtained from 100 time series ${\displaystyle z_{t_{0}},..,z_{t_{M-1}}}$ of ${\displaystyle M}$ noisy observations

${\displaystyle \qquad z_{t_{k}}=x(t_{k})+e_{t_{k}},{\text{ for }}k=0,1,..,M-1,\quad (11)}$

of ${\displaystyle x}$ on the observation times ${\displaystyle \{t\}_{M=10}=\{t_{k}=0.5+k\Delta :k=0,\ldots M-1}$, ${\displaystyle \Delta =1\}}$, with ${\displaystyle x(0.5)=1}$ and ${\displaystyle \Pi _{k}=0.0001}$. The classical and the order-${\displaystyle 1}$ Local Linearization filters of the innovation estimators ${\displaystyle ({\widehat {\alpha }}_{h,M}^{D},{\widehat {\sigma }}_{h,M}^{D})}$ and ${\displaystyle ({\widehat {\alpha }}_{h,M},{\widehat {\sigma }}_{h,M})}$ are defined as in , respectively, on the uniform time discretizations ${\displaystyle \left(\tau \right)_{h=\Delta }\equiv \{t\}_{M}}$ and ${\displaystyle \left(\tau \right)_{h=\Delta /2,\Delta /8,\Delta /32}=\{\tau _{n}:\tau _{n}=0.5+nh}$, with ${\displaystyle n=0,1,\ldots ,(M-1)/h\}}$. The number of stochastic simulations of the order-${\displaystyle 1}$ Local Linearization filter is estimated via an adaptive sampling algorithm with moderate tolerance. The Figure illustrates the convergence of the order-${\displaystyle 1}$ innovation estimator ${\displaystyle ({\widehat {\alpha }}_{h,M},{\widehat {\sigma }}_{h,M})}$ to the exact innovation estimators ${\displaystyle ({\widehat {\alpha }}_{M},{\widehat {\sigma }}_{M})}$ as ${\displaystyle h}$ decreases, which substantially improves the estimation provided by the conventional innovation estimator ${\displaystyle ({\widehat {\alpha }}_{\Delta ,M}^{D},{\widehat {\sigma }}_{\Delta ,M}^{D})}$.

Deterministic approximations

The order-${\displaystyle \beta }$ innovation estimators overcome the drawback of the conventional-type innovation estimators concerning the impossibility of reducing bias . However, the viable bias reduction of an order-${\displaystyle \beta }$ innovation estimators might eventually require that the associated order-${\displaystyle \beta }$ LMV filter performs a large number of stochastic simulations . In situations where only low or medium precision approximate estimators are needed, an alternative deterministic filter algorithm - called deterministic order-${\displaystyle \beta }$ LMV filter - can be obtained by tracking the first two conditional moments ${\displaystyle \mu }$ and ${\displaystyle \Lambda }$ of the order-${\displaystyle \beta }$ weak approximation ${\displaystyle \mathbf {y} }$ at all the time instants ${\displaystyle \tau _{n}\in \left(\tau \right)_{h}}$ in between two consecutive observation times ${\displaystyle t_{k}}$ and ${\displaystyle t_{k+1}}$. That is, the value of the predictions ${\displaystyle \mathbf {y} _{t_{k+1}/t_{k}}}$ and ${\displaystyle \mathbf {P} _{t_{k+1}/t_{k}}}$ in the filtering algorithm are computed from the recursive formulas

${\displaystyle \qquad \qquad \mathbf {y} _{\tau _{n+1}/t_{k}}=\mu (\tau _{n},\mathbf {y} _{\tau _{n}/t_{k}};h_{n})\quad }$ and ${\displaystyle \quad \mathbf {P} _{\tau _{n+1}/t_{k}}=\Lambda (\tau _{n},\mathbf {P} _{\tau _{n}/t_{k}};h_{n}),\quad }$ with ${\displaystyle \tau _{n},\tau _{n+1}\in (\tau )_{h}\cap \lbrack t_{k,}t_{k+1}],}$

and with ${\displaystyle h_{n}=\tau _{n+1}-\tau _{n}}$. The approximate innovation estimators ${\displaystyle {\widehat {\mathbf {\theta } }}_{h,M}}$ defined with these deterministic order-${\displaystyle \beta }$ LMV filters not longer converge to the exact innovation estimator, but allow a significant bias reduction in the estimated parameters for a given finite sample with a lower computational cost.

Figure 2 presents the histograms and the confidence limits of the approximate innovation estimators ${\displaystyle ({\widehat {\alpha }}_{h,M},{\widehat {\sigma }}_{h,M})}$ and ${\displaystyle ({\widehat {\alpha }}_{\cdot ,M},{\widehat {\sigma }}_{\cdot ,M})}$ for the parameters ${\displaystyle \alpha =1}$ and ${\displaystyle \sigma =1}$ of the Van der Pol oscillator with random frequency

${\displaystyle \qquad dx_{1}=x_{2}dt\quad (12)}$

${\displaystyle \qquad dx_{2}=(-(x_{1}^{2}-1)x_{2}-\alpha x_{1})dt+\sigma x_{1}dw\quad (13)}$

obtained from 100 time series ${\displaystyle z_{t_{0}},..,z_{t_{M-1}}}$ of ${\displaystyle M}$ partial and noisy observations

${\displaystyle \qquad z_{t_{k}}=x_{1}(t_{k})+e_{t_{k}},{\text{ for }}k=0,1,..,M-1,\quad (14)}$

of ${\displaystyle x}$ on the observation times ${\displaystyle \{t\}_{M=30}=\{t_{k}=k\Delta :k=0,\ldots M-1}$, ${\displaystyle \Delta =1\}}$, with ${\displaystyle (x_{1}(0),x_{1}(0))=(1,1)}$ and ${\displaystyle \Pi _{k}=0.001}$. The deterministic order-${\displaystyle 1}$ Local Linearization filter of the innovation estimators ${\displaystyle ({\widehat {\alpha }}_{h,,M},{\widehat {\sigma }}_{h,M})}$ and ${\displaystyle ({\widehat {\alpha }}_{\cdot ,M},{\widehat {\sigma }}_{\cdot ,M})}$ is defined , respectively, on uniform time discretizations ${\displaystyle \left(\tau \right)_{h}=\{\tau _{n}:\tau _{n}=nh}$, with ${\displaystyle n=0,1,\ldots ,(M-1)/h\}}$ and adaptive time-stepping discretization ${\displaystyle \left(\tau \right)_{\cdot }}$ with moderate relative and absolute tolerances. Observe the bias reduction of the estimated parameter as ${\displaystyle h}$ decreases.

Software

A Matlab implementation of various approximate innovation estimators is provided by the SdeEstimation toolbox . This toolbox contains various implementations of Local Linearization filters for the state estimation and, consequently, of the Innovation Estimators for the parameters. This includes deterministic and stochastic filters with fixed step sizes and number of samples, with adaptive time stepping algorithms, with adaptive sampling algorithms, as well as local and global optimization algorithms for computing the innovation estimators. For models with complete observations free of noise, various approximations to the Quasi-Maximum Likelihood estimator are implemented in R .

Referencias

1. ^ Ozaki T. (1994) "The local linearization filter with application to nonlinear system identification". In: Bozdogan H.(ed.) Proceedings of the first US/Japan Conference on the Frontiers of Statistical Modeling: An Informational Approach. 217-240. Kluwer Academic Publishers. https://doi.org/10.1007/978-94-011-0854-6_10
2. ^ Jazwinski A.H., Stochastic Processes and Filtering Theory, Academic Press, New York, 2019.
3. ^ Nielsen J.N., Vestergaard M., Madsen H. (2000) "Estimation in continuous-time stochastic volatility models using nonlinear filters", Int. J. Theor. Appl. Finance, 3, 279–308. https://doi.org/10.1142/S0219024900000139
4. Kailath T., Lectures on Wiener and Kalman Filtering. New York: Springer-Verlag, 1981.
5. ^ Jimenez J.C., Ozaki T. (2006) "An approximate innovation method for the estimation of diffusion processes from discrete data", J. Time Series Analysis, 27, 77-97. http://dx.doi.org/10.1111/j.1467-9892.2005.00454.x
6. ^ Jimenez J.C., Yoshimoto A., Miwakeichi F. (2021) "State and parameter estimation of stochastic physical systems from uncertain and indirect measurements", Eur. Phys. J. Plus, 136, 869. https://doi.org/10.1140/epjp/s13360-021-01859-1
7. Schweppe F. (1965) "Evaluation of likelihood function for Gaussian signals", IEEE Trans. Inf. Theory, 11, 61-70. https://doi.org/10.1109/TIT.1965.1053737
8. Ljung L., System Identification, Theory for the User (2nd edn). Englewood Cliffs: Prentice Hall, 1999.
9. Ljung L., Caines P.E. (1979) "Asymptotic normality of prediction error estimators for approximate system models", Stochastics 3, 29-46. https://doi.org/10.1080/17442507908833135
10. ^ Nolsoe K., Nielsen, J.N., Madsen H. (2000) "Prediction-based estimating function for diffusion processes with measurement noise", Technical Reports 2000, No. 10, Informatics and Mathematical Modelling, Technical University of Denmark.
11. ^ Ozaki T., Jimenez J.C., Haggan V. (2000) "Role of the likelihood function in the estimation of chaos models", J. Time Ser. Anal., 21, 363-387. http://dx.doi.org/10.1111/1467-9892.00189
12. ^ Jimenez J.C. (2020) "Bias reduction in the estimation of diffusion processes from discrete observations", IMA J. Math. Control. Inform., 37, 1468-1505. https://doi.org/10.1093/imamci/dnaa021
13. ^ Jimenez J.C. (2019) "Approximate linear minimum variance filters for continuous-discrete state space models: convergence and practical adaptive algorithms", IMA J. Math. Control Inform., 36, 341-378. http://dx.doi.org/10.1093/imamci/dnx047
14. Shoji I. (1998) "A comparative study of maximum likelihood estimators for nonlinear dynamical systems", Int. J. Control, 71, 391-404. https://doi.org/10.1080/002071798221731
15. Nielsen, J. N., Madsen, H. (2001) "Applying the EKF to stochastic differential equations with level effects", Automatica, 37, 107-112. https://doi.org/10.1016/S0005-1098(00)00128-X
16. ^ Singer H. (2002) "Parameter estimation of nonlinear stochastic differential equations: Simulated maximum likelihood versus extended Kalman filter and Ito-Taylor expansion", J. Comput. Graph. Stat., 11, 972-995. https://doi.org/10.1198/106186002808
17. Ozaki T., Iino M. (2001) "An innovation approach to non-Gaussian time series analysis", J. Appl. Prob., 38A, 78-92. https://doi.org/10.1239/jap/1085496593
18. Peng H., Ozaki T., Jimenez J.C. (2002) "Modeling and control for foreign exchange based on a continuous time stochastic microstructure model", Proceedings of the 41st IEEE Conference on Decision and Control, LasVegas, Nevada USA, December 2002 IEEE, 4, 4440-4445. http://dx.doi.org/10.1109/CDC.2002.1185071
19. Kloeden P.E., Platen E., Numerical Solution of Stochastic Differential Equations, 3rd edn. Berlin: Springer, 1999.
20. SdeEstimation toolbox https://github.com/locallinearization/SdeEstimation
21. Iacus S.M., Simulation and inference for stochastic differential equations: with R examples, New York: Springer, 2008.

• Pending AfC submissions
• Pending AfC submissions in article space