On the rate of convergence of a deep recurrent neural network estimate in a regression problem with dependent data
Reviewed by Pithpith:KNAN5O3Qopen to challenge →
classification
stat.ML
cs.LG
keywords
dataregressionassumptionsdeepdependentestimatenetworkneural
read the original abstract
A regression problem with dependent data is considered. Regularity assumptions on the dependency of the data are introduced, and it is shown that under suitable structural assumptions on the regression function a deep recurrent neural network estimate is able to circumvent the curse of dimensionality.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Simultaneous Inference for Nonlinear Time Series, a Sieve M-regression Approach
Establishes a uniform Bahadur representation for sieve M-estimators under temporal dependence and constructs valid simultaneous confidence regions using Gaussian approximation and self-convolved bootstrap.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.