Def. 2: what is v1v2 and v2v1? are those inner products? Or are those some other kind of products? Until there, it seems v1,v2∈V are simple vectors, so something is unclear. Similarly, what does ⋅1 mean soon after?
Line 111 what is Sm? is it the set of permutations of m elements? However, later in Sec 3.2 this symbol is defined as the quotient Sp(2n,R)/U(n), which is adding some confusion.
Sec 5: what is An? this is introduced as a problematic infinite dimensional construction to justify the following truncation, but An was not previously introduced and motivated. Why should it be considered in the first place?
Generally speaking, Definition 2 already assumes a lot of knowledge and familiarity with the notation from the reader. While explaining all background knowledge about Weyl Algebra is beyond the scope of the paper, clarifying the notation before using it would make it much easier for non-expert readers to parse the manuscript and fill their knowledge gaps.
Also, the authors could consider a chapter in the appendix to provide the reader with the necessary preliminary knowledge.
You occasionally use Sp(2n,R) and Sp(2n), is that the same group? Maybe the manuscript could state their equivalence once and then pick a standard notation to use.
Sec 5: is the point here analogous to typical SO(3) models with tensor product non-linearities and Clebsh-Gordan transform, where each tensor-product layer can raise the max degree of the irreps? In this sense, is the learnable projection (ii) solution analogous to the typical choice of keeping only a truncated number of degrees? Maybe a side-by-side analogy with popular equivariant models and groups could help clarifying a lot of details.
Sec 6: the symplectic capacity regression task is not very clear, could this maybe be better explained with a visualization for n=1 or n=2?
Sec 6: you say "SO(2n)-equivariance is too strong a constraint to exploit the symplectic structure fully". Why is that? How do SO(2n) and Sp(2n) relate exactly? Can you first explain what are exactly the symmetries of the problem? Is it correct to assume Spn(2n)? Also, what about the Sp(2n)-MLP? In Fig. 1 it seems SO(2n)-MLP outperforms Sp(2n)-MLP despite the task being (I assume) Sp(2n) equivariant: why do you think this is the case?
Generally speaking, could you summarize the main difference between your Sp(2n)-equivariant model and the Sp(2n)-MLP baseline? Is it correct the difference boils down to the non-linear layers introduced in Sec 4?
Also, Fig. 1 doesn't show SO(2n)-MLP's performance on the PETRA III task, could you include that baseline? Same for the parity classification experiments in Table 1: why no SO(2n) baseline is considered?
I do not understand the point of the claim regarding the orthogonal group equivariance of Clifford-algebra networks. Afterall, the resulting architecture is Sp(2n)-equivariant no O(n)-equivariant. Is this claim saying that the current architecture would be equivalent to Clifford-algebra networks if the equivariance constraints would be restricted to O(n)?
The paper concludes with a brief mention of computational limitations. Could the author further expand on that?
The appendix provides very little additional details. Could the author share some more details about the underlying implementation? Maybe a schematic overview of the architecture and of each of its layers could help clarify.
How is the integral in the Moyal trace computed for the normalization N3?
Could you provide the exact formulation of normalization N4? It's hard to understand how that works and if it is really equivariant.
Since you use some non-equivariant normalization layers, could you provide some quantitative analysis of the degree of equivariance maintained by the model after training? Is the model still approximately equivariant or does it exploit these layers to break it? Also to what extent do these layer break equivariance in the first place? Could you comment on this?