Learning CHARME models with neural networks

arXiv2002.03237MaRDI QIDQ6334391

Author name not available (Why is that?)

Publication date: 8 February 2020

Abstract: In this paper, we consider a model called CHARME (Conditional Heteroscedastic Autoregressive Mixture of Experts), a class of generalized mixture of nonlinear nonparametric AR-ARCH time series. Under certain Lipschitz-type conditions on the autoregressive and volatility functions, we prove that this model is stationary, ergodic and $au$-weakly dependent. These conditions are much weaker than those presented in the literature that treats this model. Moreover, this result forms the theoretical basis for deriving an asymptotic theory of the underlying (non)parametric estimation, which we present for this model. As an application, from the universal approximation property of neural networks (NN), we develop a learning theory for the NN-based autoregressive functions of the model, where the strong consistency and asymptotic normality of the considered estimator of the NN weights and biases are guaranteed under weak conditions.

Has companion code repository: https://github.com/jose3g/Learning_CHARME_models_with_DNN

This page was built for publication: Learning CHARME models with neural networks

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