A path-matrix algorithm yields irreducible Cartesian tensor decomposition matrices up to rank 9 and orthogonal bases of equivariant spaces, surpassing prior rank-5 and spanning-set limits.
An Algorithm for Computing with Brauer's Group Equivariant Neural Network Layers
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The learnable, linear neural network layers between tensor power spaces of $\mathbb{R}^{n}$ that are equivariant to the orthogonal group, $O(n)$, the special orthogonal group, $SO(n)$, and the symplectic group, $Sp(n)$, were characterised in arXiv:2212.08630. We present an algorithm for multiplying a vector by any weight matrix for each of these groups, using category theoretic constructions to implement the procedure. We achieve a significant reduction in computational cost compared with a naive implementation by making use of Kronecker product matrices to perform the multiplication. We show that our approach extends to the symmetric group, $S_n$, recovering the algorithm of arXiv:2303.06208 in the process.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces
A path-matrix algorithm yields irreducible Cartesian tensor decomposition matrices up to rank 9 and orthogonal bases of equivariant spaces, surpassing prior rank-5 and spanning-set limits.