Summary
The paper provides a constructive proof that state-space models (SSMs) are universal approximators of sequence-to-sequence mappings.
Moreover, it shows that SSMs (and even empirically S4) suffer from exponentially decaying memory just like standard RNNs.
Strengths
Up to my knowledge this is the first (constructive) proof that SSMs are universal. I find it in particular interesting that SSMs also suffer from exponentially decaying memory (given the provided definition of such).
Weaknesses
Regrettably, the paper exhibits a significant lack of quality in its writing, containing numerous grammatical errors and typos. It is imperative that it undergoes a comprehensive proofreading process to address these issues.
From my understanding, the paper proves universality for SSMs, which does not include universality for S4 (i.e., SSMs with specific structure of the matrices). This is a major limitation, as in practice no one uses simple SSMs, but only S4. Can S4 be included in the proof? I presume one has to show that also S4 can approximate element-wise functions up to any precision.
The section about the curse of memory is very hard to follow. Can you please rewrite it and properly introduce the concept of memory functions?
The paper is not rigorously written. For instance, it would be much more readable, if the authors would define every variable, e.g., $W \in \mathbb{R}^{m\times m}$ and so on. This would also help the authors avoid using variables that haven't been introduced before.
The provided full paper in the appendix and the main paper differ: for instance in equation 9: $\mathbf{H}$ depends on $t$ in the full paper, but not in the main paper.
Form what I understood, the universality proof of proposition 3.6 approximates functions, where the target value at every index depends on all elements in the full input sequence. However, this is not realistic, as mainly causal operators between sequences have to be learned, i.e., operators that are independent of the future values of the input sequence at every index. Can you please change the proof accordingly?
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
2: You are willing to defend your assessment, but it is quite likely that you did not understand the central parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
The paper provides an interesting and important proof that SSMs are universal, as well as that the memory functions decay exponentially. However, the proof does not include S4 models. Moreover, the quality of writing is very poor, which makes it hard to follow. Overall, the provided proof is very simple, which makes it appealing.