Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 19 November 2019

Abstract and Keywords

This article considers nonlinear forecasting models, such as switching-regime models. These models are typically “small” compared to vector autoregressive and factor models, being either univariate or single-equation models, but tend to nest a linear relationship and so invite an assessment of whether allowing for nonlinearity improves forecast accuracy. The article is organized as follows. Section 2 considers a number of parametric time series models. Some universal approximators, including neural network models, are studied in Section 3. Forecasting several periods ahead with nonlinear models is the topic of Section 4. Forecasting with chaotic systems is briefly considered in Section 5. Comparisons of linear and nonlinear forecasts of economic time series are discussed in Section 6, and studies comprising a large number of series are discussed in Section 7. Section 8 contains a limited forecast accuracy comparison between recursive and direct forecasts. Final remarks and suggestions for further reading can be found in Section 9.

Keywords: nonlinear forecasting models, economic forecasting, neural network models, chaotic systems, nonlinear forecasts

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.