z-logo
Premium
Accounting for Lag Order Uncertainty in Autoregressions: the Endogenous Lag Order Bootstrap Algorithm
Author(s) -
Kilian Lutz
Publication year - 1998
Publication title -
journal of time series analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.576
H-Index - 54
eISSN - 1467-9892
pISSN - 0143-9782
DOI - 10.1111/1467-9892.00107
Subject(s) - lag , autoregressive model , distributed lag , mathematics , spurious relationship , bootstrapping (finance) , monte carlo method , econometrics , lead–lag compensator , statistics , algorithm , computer science , control engineering , engineering , computer network
Conventional asymptotic and bootstrap methods for finite‐order autoregressive models condition on the estimated lag order of the model as though it were known to be the true lag order. Even if the order is estimated correctly, this procedure ignores the sampling uncertainty about the lag order estimate and may result in spurious inferences. In this paper an appropriately modified bootstrap algorithm is introduced that reflects the true extent of sampling uncertainty in the regression estimates. This endogenous lag order bootstrap algorithm recognizes that lag order selection is an integral part of the sampling procedure by re‐estimating the lag order in each bootstrap iteration. It is suggested that the endogenous lag order bootstrap algorithm should routinely replace the standard bootstrap algorithm in applications. Monte Carlo simulations show that ignoring lag order uncertainty may seriously undermine the coverage accuracy of bootstrap confidence intervals for vector autoregression impulse response estimates. Endogenizing the lag order choice is shown to improve coverage accuracy in small samples at negligible additional computational cost. As the lag order uncertainty declines in large samples, the performance of the endogenous lag order interval converges to that of the standard interval.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here