Fading memory and the convolution theorem
Not on the map. Why?
Abstract (arXiv)
Several topological and analytical notions of continuity and fading memory for causal and time-invariant filters are introduced, and the relations between them are analyzed. A significant generalization of the convolution theorem that establishes the equivalence between the fading memory property and the availability of convolution representations of linear filters is proved. This result extends a previous similar characterization to a complete array of weighted norms in the definition of the fading memory property. Additionally, the main theorem shows that the availability of convolution representations can be characterized, at least when the codomain is finite-dimensional, not only by the fading memory property but also by the reunion of two purely topological notions that are called minimal continuity and minimal fading memory property. Finally, when the input space and the codomain of a linear functional are Hilbert spaces, it is shown that minimal continuity and the minimal fading memory property guarantee the existence of interesting embeddings of the associated reproducing kernel Hilbert spaces.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 65 references that are in the map. First posted on arXiv 14 Aug 2024.
Builds on
17 of 65 references.
References · 17
- 2017Attention Is All You Needcited by 60,361
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2018Echo state networks are universalcited by 87
- 2024Mamba-360: Survey of State Space Models as Transformer Alternative for Long Sequence Modelling: Methods, Applications, and Challengescited by 64
- 2020Approximation Bounds for Random Neural Networks and Reservoir Systemscited by 52
- 2019Formulas for Data-driven Control: Stabilization, Optimality and Robustnesscited by 47
- 2017Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systemscited by 39
- 2020Fading memory echo state networks are universalcited by 32
- 2020On the Curse of Memory in Recurrent Neural Networks: Approximation and Optimization Analysiscited by 27
- 2019Differentiable reservoir computingcited by 20
- 2023A Brief Survey on the Approximation Theory for Sequence Modellingcited by 15
- 2019A trajectory-based framework for data-driven system analysis and controlcited by 11
5 more
- 2020Dimension reduction in recurrent networks by canonicalizationcited by 11
- 2020Willems' Fundamental Lemma for State-space Systems and its Extension to Multiple Datasetscited by 8
- 2023Infinite-dimensional reservoir computingcited by 7
- 2021Kernel-based models for system analysiscited by 4
- 2024Kernel Modelling of Fading Memory Systemscited by 1
Built on by
Citing papers per year: 2025: 2.
2 papers.