Projection Pursuit Autoregression in Time Series

From MaRDI portal





Suppose that \(y_t\) is an observed stationary time series defined by \( y_t=G(x_t)+\varepsilon_t \), where \(\varepsilon_t\) are i.i.d. random variables, \(x_t\in R^p\) are the lag variables for \(y_t\) and possibly other explanatory variables \(G(x)=E(y_t |x_t=x)\). For any \(p\)-dimensional unit vector \(\vartheta\) denote \( \phi_\vartheta(\vartheta^Tx)=E(y_t |\vartheta^Tx_t=\vartheta^T x) \). Then the first projection pursuit component of \(G\) within a bounded region \(\mathcal A\) is \(\vartheta_1\), which minimizes \[ S(\vartheta)=E((G(x_1)-\phi_\vartheta(\vartheta^T x))^2I\{x\in {\mathcal A}\}). \] One can define the second, the third,\dots, components analogously. The authors concentrate on estimation of \(\vartheta_1\). An estimator \(\hat\vartheta_1\) is constructed using a kernel regression estimator for \(\phi_\vartheta\) and a residual sum of squares \(\hat S_n(\vartheta)\) instead of \(S\). It is demonstrated that \(\hat\vartheta_1-\vartheta_1=O(n^{-1/(2r+1)})\), where \(n\) is the number of observations and \(G\) has continuous derivatives of \((r+1)\)-th order. Results of simulations and a real data example are presented.











This page was built for publication: Projection Pursuit Autoregression in Time Series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956038)