Pith. sign in

REVIEW 1 cited by

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

arxiv 2011.00328 v1 pith:KNAN5O3Q submitted 2020-10-31 stat.ML cs.LG

On the rate of convergence of a deep recurrent neural network estimate in a regression problem with dependent data

classification stat.ML cs.LG
keywords dataregressionassumptionsdeepdependentestimatenetworkneural
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Simultaneous Inference for Nonlinear Time Series, a Sieve M-regression Approach

    math.ST 2026-05 unverdicted novelty 6.0

    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.