Nonparametric GARCH: An Iterated Neural Estimator
Ruizhi Deng, Guohao Shen, Ngai Hang Chan
Abstract
We study nonparametric estimation and forecasting for GARCH-type processes and propose an iterated neural estimator that alternates between estimating the recursion map and updating the unobserved conditional variances. Under mild conditions, we establish finite-sample bounds for the time-averaged in-sample variance-path error and show that the estimator is minimax rate-optimal up to logarithmic factors. Under stationarity and mixing conditions, we establish the same rate for recursion-map estimation and derive finite-sample bounds for out-of-sample variance forecasts and expected excess Gaussian quasi-likelihood (QLIKE) loss. The convergence rates depend on the true lag orders and remain unchanged when the fitted orders are overspecified. Simulation studies illustrate the effectiveness of our estimators under nonlinear and time-varying volatility dynamics. Real-data applications suggest that our neural methods perform competitively and can incorporate option-price and high-frequency information.
Create a lesson
Related papers
Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits
Jongyeong Lee, Hyundam Yoo
How Risky Is Your Data-Driven Policy?
Omar Besbes, Alon Rieger
Two-Layer Random ReLU Networks Can Separate Disjoint Classes
Yichen Liu, Jianbin Yang
Point interpolation and distributional universality in flow-based generative models
Antonio Álvarez-López, Jingpu Cheng, Liyan Zhang et al.
Error Accumulation in Second-Order Sequential Machine Unlearning
Chen Shang, Haolin Zou, Binghe Zhu et al.
Subpolynomial-Query Proximal Sampling Beyond Log-Concavity
Wei Guo, Bo Yuan, Ye He et al.