Pith. sign in

REVIEW 1 cited by

Echo state networks are universal

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 1806.00797 v2 pith:ZM46WOVQ submitted 2018-06-03 cs.NE cs.AI

classification cs.NEcs.AI
keywords fadingmemoryechoinfinitenetworksreservoirstatetime
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper shows that echo state networks are universal uniform approximants in the context of discrete-time fading memory filters with uniformly bounded inputs defined on negative infinite times. This result guarantees that any fading memory input/output system in discrete time can be realized as a simple finite-dimensional neural network-type state-space model with a static linear readout map. This approximation is valid for infinite time intervals. The proof of this statement is based on fundamental results, also presented in this work, about the topological nature of the fading memory property and about reservoir computing systems generated by continuous reservoir maps.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Dynamical learning and quantum memory with non-Hermitian many-body systems

    quant-ph 2025-06 conditional novelty 5.0 of 10

    In a non-Hermitian spin reservoir on random graphs, the onset of the first exceptional point coincides with an abrupt jump in memory capacity, yielding a tunable learnability threshold.

Pith tools