2000 character limit reached
Fading memory echo state networks are universal
Published 22 Oct 2020 in cs.NE | (2010.12047v1)
Abstract: Echo state networks (ESNs) have been recently proved to be universal approximants for input/output systems with respect to various $L p$-type criteria. When $1\leq p< \infty$, only $p$-integrability hypotheses need to be imposed, while in the case $p=\infty$ a uniform boundedness hypotheses on the inputs is required. This note shows that, in the last case, a universal family of ESNs can be constructed that contains exclusively elements that have the echo state and the fading memory properties. This conclusion could not be drawn with the results and methods available so far in the literature.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.