REVIEW
On the rate of convergence of a deep recurrent neural network estimate in a regression problem with dependent data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
stat.MLcs.LG
keywords
dataregressionassumptionsdeepdependentestimatenetworkneural
Signed reviews
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.
Discussion (0). Continue with ORCID to comment.